(Enter summary)
Abstract: ions are compiled to the closure command, which will push a closure onto
the Stack. The closure will include the current Environment and will hold M as a list
of commands, from compilation:
[[x:M ]] = closure(x; [[M ]])
Applications are compiled to the app command at compile time. Under the interpreted
SECD machine, this work occurred at run time:
[[MN ]] = [[N ]]; [[M ]]; app
We could add further instructions, say for conditionals. Let test(C 1 ; C 2 ) be replaced
by C 1 or C 2 , depending... (Update)
Context of citations to this paper: More
.... [6] for compilation of ML, which is interpreted by the Functional Abstract Machine (Fam) The Fam can be considered an SECD machine [9] which has been optimised to allow fast function application and the use of true stacks. To take advantage of the fast function...
...that only a few of the basic concepts described in these books will be needed. Lecture notes on functional programming by Paulson [Pau00] Several reference articles by Barendregt on lambda calculi and functional programming [Bar77,Bar90,Bar92] We use both dependent...
Cited by: More
Normalization and Partial Evaluation - Dybjer, Filinski (2002)
(Correct)
Implementation of an Imperative Object Calculus - Computer Science Tripos
(Correct)
Calculus Af2@ - Ae Ahxz Svaf
(Correct)
Similar documents (at the sentence level):
58.6%: Foundations of Functional Programming - Paulson (2000)
(Correct)
Active bibliography (related documents): More All
0.1: A Parallel Virtual Machine for Bulk Synchronous Parallel ML - Gava, Loulergue (2003)
(Correct)
0.1: Aspects Theoriques Et Pratiques De L'inferences De Type Et Effets - Talpin (1993)
(Correct)
0.1: Polymorphic Type Inference and Assignment - Leroy, Weis (1991)
(Correct)
Similar documents based on text: More All
0.3: Logic and Proof - Computer Science Tripos (2002)
(Correct)
0.2: Software Engineering II - Computer Science Tripos (2002)
(Correct)
0.2: Foundations of Computer - Science Computer Science (2002)
(Correct)
Related documents from co-citation: More All
2: Functional programming and lambda calculus (context) - Barendregt - 1992
2: Intuitionistic model constructions and normalization proofs
- Coquand, Dybjer - 1997
BibTeX entry: (Update)
L. C. Paulson. Foundations of functional programming. Manuscript, 1995. http://citeseer.comp.nus.edu.sg/127769.html More
@misc{ paulson95foundations,
author = "L. Paulson",
title = "Foundations of functional programming",
text = "L. C. Paulson. Foundations of functional programming. Manuscript, 1995.",
year = "1995",
url = "citeseer.comp.nus.edu.sg/127769.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
333
Introduction to Functional Programming (context) - Bird, Wadler - 1988
218
The mechanical evaluation of expressions (context) - Landin - 1964
143
A new implementation technique for applicative languages (context) - Turner - 1979
137
Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
84
The next 700 programming languages (context) - Landin - 1966
67
Recursive Programming Techniques (context) - Burge - 1975
50
Programming Language Theory and its Implementation (context) - Gordon - 1988
30
Field and Peter G (context) - Anthony - 1988
10
Technical report (context) - Cousineau, Huet et al. - 1990
Documents on the same site (http://www.cs.chalmers.se/~rjmh/tutorials.html): More
Polymorphic Type Inference - Schwartzbach (1995)
(Correct)
Introduction to Functional Programming using Gofer - Wentworth (1990)
(Correct)
Basic Polymorphic Typechecking - Cardelli (1988)
(Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.