See this document in CiteSeerX!

The AMEN architecture  (Make Corrections)  
Peter Hancock Abandoned draft of Jan 99



  Home/Search   Context   Related

 
View or download:
dcs.ed.ac.uk/home/pgh/amen.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dcs.ed.ac.uk/home/pgh/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: There are many combinatorially complete sets of combinators, or `instruction sets' to which the -calculus can be compiled. The most famous are perhaps fS; K g and fB;C;K;W g. Several authors have observed that there is a set of `arithmetical' combinators fA; M;E;N g arising from the Church numerals, which is also combinatorially complete. However their sets of combinators are not absolutely perfect. The perfect set of combinators ( f(+); (); (^); 0g in section-notation) is de ned... (Update)

Similar documents (at the sentence level):
8.7%:   Ordinals and Interactive Programs - Hancock (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Short Proofs of Normalization for the simply-typed.. - Joachimski, Matthes (2002)   (Correct)
0.5:   A lambda-to-CL Translation for Strong Normalization - Akama (1997)   (Correct)
0.2:   The New GHC/Hugs Runtime System - Marlow, Jones (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   Interactive Programs in Dependent Type Theory - Hancock, Setzer, Clerk (2000)   (Correct)
0.1:   The Plastic Behaviour of Cold-Formed Rectangular Hollow Sections - Wilkinson (1999)   (Correct)
0.1:   On the Structure of Complete Sets - Buhrman, Torenvliet (1994)   (Correct)

BibTeX entry:   (Update)

@misc{ abandoned-amen,
  author = "Peter Hancock Abandoned",
  title = "The AMEN architecture.",
  url = "citeseer.ist.psu.edu/673164.html" }
Citations (may not include all citations):
359   The Implementation of Functional Programming Languages (context) - Jones - 1987
185   The Calculi of Lambda Conversion (context) - Church - 1941
143   A new implementation technique for applicative languages (context) - Turner - 1979
67   Recursive Programming Techniques (context) - Burge - 1975
29   of programming languages. PRG-40. PhD thesis, Programming Re.. - Hughes, implementation - 1984
26   volume 43 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Troelstra, Schwichtenberg et al. - 1996
18   Proof Theory (context) - Sch - 1977
15   Zur konstruktion von ordnungszahlen (context) - Neumer - 1954
15   Zur konstruktion von ordnungszahlen (context) - Neumer - 1953
15   Zur konstruktion von ordnungszahlen (context) - Neumer - 1954
15   Zur konstruktion von ordnungszahlen (context) - Neumer - 1954
15   Zur konstruktion von ordnungszahlen (context) - Neumer - 1956
10   Routledge and Kegan Paul (context) - Wittgenstein - 1961
7   London Mathematical Society monographs (context) - Conway, Games - 1976
6   Clarendon Press (context) - Potter, An - 1990
5   The elements of mathematical logic (context) - Rosenbloom - 1950
5   Ordinal analysis of terms of nite type (context) - Howard - 1980
4   Fixing a space leak with a garbage collector (context) - Wadler - 1987
3   volume 42 of Synthese Library (context) - oren, Combinators et al. - 1972
3   Zur berechenbarkeit primitiv-recursiver functionale endliche.. (context) - Diller - 1970
3   Functionals de ned by recursion (context) - Sanchis - 1967
2   Half-ring morphologies (context) - Davis - 1967
2   ur mathematische Logik und Grundlagen der Mathematik (context) - Neumer, ur et al. - 1957
2   ur mathematische Logik und Grundlagen der Mathematik (context) - Neumer, ur et al. - 1960
2   Hereditarily replete functionals over the ordinals (context) - Feferman - 1968
2   Assignment of ordinals to terms for primitive recursive func.. (context) - Howard - 1968
1   Describing ordinals using functionals of trans nite type (context) - Aczel - 1972
1   A simple ordinal recursive normalisation of godel's t (context) - Voda
1   Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Howard - 1973
1   A proof of strong uniform termination for godel's T by meth.. (context) - Weiermann - 1997

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC