See this document in CiteSeerX!

The systematic construction of a one-combinator basis for Lambda-terms (1997)  (Make Corrections)  
Jeroen Fokker
Formal Aspects of Computing



  Home/Search   Context   Related

 
View or download:
cs.ruu.nl/people/jeroe...combinat.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.ruu.nl/people/jeroen/a...index (more)
(Enter author homepages)

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

Abstract: . A single closed -expression that generates all -expressions is constructed. The derivation is carried out with simplicity as driving force. The result is simpler than single-combinator bases known in the literature. 1. Combinator bases A combinator is a closed -term, i.e. an expression formed by -abstraction and application that does not contain free variables. Some commonly used combinators are S = fgx:fx(gx) K = xy:x I = x:x In this article, lower case is used for variables in the... (Update)

Similar documents (at the sentence level):
20.7%:   The Systematic Construction of a One-Combinator Basis - Fokker (1989)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Bracket abstraction in the combinator system Cl(K) - Broda, Damas   (Correct)
0.1:   A Note on Absolutely Unorderable Combinatory Algebras - Lusin, Salibra (2001)   (Correct)
0.1:   Relating Categorial Type Logics and CCG through simulation - Kruijff, al. (2000)   (Correct)

Similar documents based on text:   More   All
0.1:   Deterministic, Error-Correcting Combinator Parsers - Swierstra, Duponcheel (1996)   (Correct)
0.1:   A Morphological Analyzer For Turkish Using Combinator Parsing - Pembeci   (Correct)
0.1:   Parsec, a Fast Combinator Parser - Leijen   (Correct)

BibTeX entry:   (Update)

@article{ fokker92systematic,
    author = "Jeroen Fokker",
    title = "The Systematic Construction of a One-Combinator Basis for Lambda-Terms",
    journal = "Formal Aspects of Computing",
    volume = "4",
    number = "6A",
    pages = "776-780",
    year = "1992",
    url = "citeseer.ist.psu.edu/fokker97systematic.html" }
Citations (may not include all citations):
359   The implementation of functional programming languages (context) - Jones - 1987
210   its syntax and semantics (context) - Barendregt - 1984
29   Uber die Bausteine der mathematischen Logik (context) - Schonfinkel - 1924
7   Combinatory logic Vol (context) - Curry, Feys - 1958

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