- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
An extension of the basic functionality theory for the $\lambda$-calculus
Notre Dame Journal of Formal Logic 21 (4):685-693 (1980)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Topological Representation of the Lambda-Calculus.Steve Awodey - 2000 - Mathematical Structures in Computer Science 10 (1):81-96.
The lambda calculus: its syntax and semantics.Hendrik Pieter Barendregt - 1981 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co..
Introduction to Combinators and (Lambda) Calculus.J. Roger Hindley - 1986 - New York: Cambridge University Press. Edited by J. P. Seldin.
Categorical semantics for higher order polymorphic lambda calculus.R. A. G. Seely - 1987 - Journal of Symbolic Logic 52 (4):969-989.
Recursion theory and the lambda-calculus.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):67-83.
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
Completeness of transfinite evaluation in an extension of the lambda calculus.Luis E. Sanchis - 1987 - Journal of Symbolic Logic 52 (1):243-275.
Lambda-calculus, combinators, and functional programming.György E. Révész - 1988 - New York: Cambridge University Press.
A modern elaboration of the ramified theory of types.Twan Laan & Rob Nederpelt - 1996 - Studia Logica 57 (2-3):243 - 278.
A Filter lambda model and the completeness of type assignment.Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini - 1983 - Journal of Symbolic Logic 48 (4):931-940.
The impact of the lambda calculus in logic and computer science.Henk Barendregt - 1997 - Bulletin of Symbolic Logic 3 (2):181-215.
The abstract variable-binding calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
Alonzo church:his life, his work and some of his miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.
Analytics
Added to PP
2010-08-24
Downloads
40 (#387,619)
6 months
10 (#257,583)
2010-08-24
Downloads
40 (#387,619)
6 months
10 (#257,583)
Historical graph of downloads
Citations of this work
Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2-6):45-58.
The emptiness problem for intersection types.Paweł Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing.Steffen van Bakel - 2004 - Notre Dame Journal of Formal Logic 45 (1):35-63.
A completeness result for a realisability semantics for an intersection type system.Fairouz Kamareddine & Karim Nour - 2007 - Annals of Pure and Applied Logic 146 (2):180-198.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-pp8v9 uwo