Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Haskell
Wiki community
Recent changes
Random page
HaskellWiki
Search
Search
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Capitole de manual
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Special pages
Page information
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==. Capitol bonus. == * [http://wiki.haskell.org/wikiupload/b/b1/Back-End.pdf Back-End.pdf (298KB, MIME type:pdf)] Arborii sintaxei abstracte atasati constructiilor sintactice ale unui limbaj pot/vor fi folositi de catre a doua parte a interpretorului (Back-End-ul) pentru a rula codul respectiv. Un asemnea Back-End monadic este explicat in capitolul acesta. Back-End-ul acesta l-am folosit in cadrul lucrarilor de laborator pentru a putea rula programele reprezentate prin AST (abstract syntax tree). Acest capitol on-line oferit ca bonus a fost ulterior inclus in volumul [[Practica interpretarii monadice]]. (Dan Popa, Universitatea Bacau, Versiuni aflate în lucru sau definitivate în octombrie noiembrie si decembrie 2006 si altele. Ultimul update minor 27 mai.2007, scos pretul vechi în nov 2009.)
Summary:
Please note that all contributions to HaskellWiki are considered to be released under simple permissive license (see
HaskellWiki:Copyrights
for details). If you don't want your writing to be edited mercilessly and redistributed at will, then don't submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
DO NOT SUBMIT COPYRIGHTED WORK WITHOUT PERMISSION!
Cancel
Editing help
(opens in new window)
Toggle limited content width