J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #-Calculus. Cambridge University Press, 1986. 17 Ravara, Matos et al. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Proof-Theoretic Characterization of the Basic Feasible.. - Strahm (2002) (Correct)
....of the partial recursive functions over W. It is easy to find interpretations of the constants of so that all the axioms of PT are true in PRO . A further important model of PT is the open term model M(##) This model is based on the usual ## reduction of the untyped lambda calculus (cf. [1, 16]) and exploits the well known equivalence between combinatory logic with extensionality and ##. In order to deal with the constants di#erent from k and s, one extends ## reduction by the obvious reduction clauses for these new constants and checks that the so obtained new reduction relation enjoys ....
Hindley, J. R., and Seldin, J. P. Introduction to Combinators and #-Calculus. Cambridge University Press, 1986.
Curry's Anticipation of the Types Used in Programming Languages - Seldin (2003) Self-citation (Seldin) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #-calculus. Cambridge University Press, 1986.
Electronic Notes in Theoretical Computer Science 85 No. 1 (2003) - Url Http Www (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #-Calculus. Cambridge University Press, 1986. 17 Ravara, Matos et al.
A Functional Shell That Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2004) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #- Calculus. Cambridge University Press, 1986. ISBN 0521268966.
Combinatory Representation of Mobile Processes - Kohei Honda Kohei (1994) (19 citations) (Correct)
No context found.
Hindley, J. R. and Seldin J. P., Introduction to Combinators and -Calculus. Cambridge University Press, 1986.
Static Control of Code Migration - Francisco Martins And (Correct)
No context found.
J. R. Hindley and J. P. Seldin. Introduction to Combinators and #-Calculus. Cambridge University Press, 1986.
Using, Understanding, and Unraveling - The OCaml Language - From.. - Remy (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and -calculus. Volume 1 of London Mathematical Society Student texts. Cambridge University Press, 1986.
An Illative Theory of Relations - Plotkin (1990) (7 citations) (Correct)
No context found.
Hindley, J. R. & J. P. Seldin, (1986). Introduction to Combinators and #-calculus. London Mathematical Society Student Texts, 1. Cambride University Press: Cambridge.
Lexically Scoped Distribution: What You See is What You.. - Ravara, Matos.. (2003) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #-Calculus. Cambridge University Press, 1986. 17 Ravara, Matos et al.
On Statman's Finite Completeness Theorem - Richard Statman Gilles (1992) (1 citation) (Correct)
No context found.
J.R. Hindley, J.P. Seldin, Introduction to Combinators and -Calculus, Cambridge University Press, 1986.
Higher-Order Functional-Logic Programming: A Systematic Development - Prehofer (1997) (Correct)
No context found.
J.R. Hindley and J. P. Seldin. Introduction to Combinators and -Calculus. Cambridge University Press, 1986.
A Functional Shell that Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2004) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #- Calculus. Cambridge University Press, 1986. ISBN 0521268966.
A Functional Shell that Dynamically Combines Compiled Code - van Weelden, Plasmeijer (2003) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #- Calculus. Cambridge University Press, 1986. ISBN 0521268966.
Higher-Order Narrowing with Convergent - Systems Christian Prehofer (1995) (Correct)
No context found.
J.R. Hindley and Jonathan P. Seldin. Introduction to Combinators and -Calculus. Cambridge University Press, 1986.
Higher-Order Narrowing - Christian Prehofer Institut (1994) (11 citations) (Correct)
No context found.
J.R. Hindley and Jonathan P. Seldin. Introduction to Combinators and -Calculus.Cambridge University Press, 1986.
Object-Oriented Software Specification in Programming.. - Bryant, Vaidyanathan (Correct)
No context found.
J. Hindley and R. Seldin. Introduction to Combinators and -Calculus. Cambridge Univ. Press, 1986.
The Complexity Of Derivations Of Matrix Identities - Soltys-Kulinicz (2001) (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and -Calculus. Cambridge University Press, 1986.
Communication Errors in the π-Calculus are Undecidable - Vasconcelos, Ravara (Correct)
No context found.
J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and #-Calculus, page 63. Cambridge University Press, 1986.
Higher-Order Narrowing with Definitional Trees - Michael Hanus And (1996) (25 citations) (Correct)
No context found.
J.R. Hindley and J. P. Seldin. Introduction to Combinators and -Calculus. Cambridge University Press, 1986.
A Structural Approach to Reversible Computation - Abramsky (2001) (Correct)
No context found.
J. R. Hindley and J. P Seldin. Introduction to Combinators and the -calculus. Cambridge University Press, 1986.
About the Confluence of Equational Pattern Rewrite Systems - Boudet, Contejean (Correct)
No context found.
R. Hindley and J. Seldin. Introduction to Combinators and -calculus. Cambridge University Press, 1986.
Parametric Parameter Passing λ-calculus - Paolini, Rocca (2003) (Correct)
No context found.
Hindley, J.R., Seldin, J.P., \Introduction to Combinators and -Calculus" Cambridge University Press, 1986.
On Functions and Types - Kamareddine (Correct)
No context found.
J.R. Hindley and J.P. Seldin. Introduction to Combinators and -calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, 1986.
Revisiting the Notion of Function - Kamareddine, Laan, Nederpelt (Correct)
No context found.
J.R. Hindley and J.P. Seldin. Introduction to Combinators and -calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, 1986.
Formalizing Non-Termination of Recursive - Programs Reinhard Kahle (2001) (Correct)
No context found.
James Hindley and Jonathan Seldin. Introduction to Combinators and #-calculus. Cambridge University Press, 1986.
First 50 documents Next 50
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