- Combinatory Logic.J. Barkley Rosser - 1967 - Journal of Symbolic Logic 32 (2):267-268.details
|
|
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..details
|
|
Cut-elimination and normalization.J. Zucker - 1974 - Annals of Mathematical Logic 7 (1):1.details
|
|
λ-Definability on free algebras.Marek Zaionc - 1991 - Annals of Pure and Applied Logic 51 (3):279-300.details
|
|
The emptiness problem for intersection types.Paweł Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.details
|
|
On definition trees of ordinal recursive functonals: Reduction of the recursion orders by means of type level raising.Jan Terlouw - 1982 - Journal of Symbolic Logic 47 (2):395-402.details
|
|
Completeness, invariance and λ-definability.R. Statman - 1982 - Journal of Symbolic Logic 47 (1):17-26.details
|
|
Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.details
|
|
On church's formal theory of functions and functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.details
|
|
Higher Order Matching is Undecidable.Ralph Loader - 2003 - Logic Journal of the IGPL 11 (1):51-68.details
|
|
Universal diophantine equation.James P. Jones - 1982 - Journal of Symbolic Logic 47 (3):549-571.details
|
|
Third order matching is decidable.Gilles Dowek - 1994 - Annals of Pure and Applied Logic 69 (2-3):135-155.details
|
|
Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Journal of Symbolic Logic 63 (3):869-890.details
|
|
Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem.N. G. De Bruijn - 1975 - Journal of Symbolic Logic 40 (3):470-470.details
|
|
The Decision Problem for Exponential Diophantine Equations.Martin Davis, Hilary Putnam & Julia Robinson - 1970 - Journal of Symbolic Logic 35 (1):151-152.details
|
|
Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2‐6):45-58.details
|
|
Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2-6):45-58.details
|
|
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.details
|
|
A formulation of the simple theory of types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.details
|
|
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.details
|
|
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.details
|
|
Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Mathematical Logic Quarterly 20 (19‐22):289-306.details
|
|
Pairing Without Conventional Restraints.Henk Barendregt - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (19-22):289-306.details
|
|
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.details
|
|
Domain theory in logical form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.details
|
|
Handbook of Logic in Computer Science.S. Abramsky, D. Gabbay & T. Maibaurn (eds.) - 1992 - Oxford University Press.details
|
|
The Emptiness Problem for Intersection Types.Pawel Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.details
|
|
The formulae-as-types notion of construction.William Alvin Howard - 1980 - In Haskell Curry, Hindley B., Seldin J. Roger & P. Jonathan (eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. Academic Press.details
|
|
Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in Mathematics. Amsterdam: North-Holland Pub. Co.. pp. 101--128.details
|
|