- Ternary relations and relevant semantics.Robert K. Meyer - 2004 - Annals of Pure and Applied Logic 127 (1-3):195-217.details
|
|
On the unity of duality.Noam Zeilberger - 2008 - Annals of Pure and Applied Logic 153 (1-3):66-96.details
|
|
Combinator logics.Lou Goble - 2004 - Studia Logica 76 (1):17 - 66.details
|
|
The Semantics of Entailment Omega.Yoko Motohama, Robert K. Meyer & Mariangiola Dezani-Ciancaglini - 2002 - Notre Dame Journal of Formal Logic 43 (3):129-145.details
|
|
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08.Alex J. Wilkie - 2009 - Bulletin of Symbolic Logic 15 (1):95-139.details
|
|
Comparing cubes of typed and type assignment systems.Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca & Pawel Urzyczyn - 1997 - Annals of Pure and Applied Logic 86 (3):267-303.details
|
|
Completeness and partial soundness results for intersection and union typing for http://ars. els-cdn. com/content/image/http://origin-ars. els-cdn. com/content/image/1-s2. 0-S0168007210000515-si1. gif"/>. [REVIEW]Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.details
|
|
Completeness and partial soundness results for intersection and union typing for λ ¯ μ μ ̃.Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.details
|
|
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.details
|
|
Strong Normalization and Typability with Intersection Types.Silvia Ghilezan - 1996 - Notre Dame Journal of Formal Logic 37 (1):44-52.details
|
|
On church's formal theory of functions and functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.details
|
|
A domain model characterising strong normalisation.Ulrich Berger - 2008 - Annals of Pure and Applied Logic 156 (1):39-50.details
|
|
Term-Space Semantics of Typed Lambda Calculus.Ryo Kashima, Naosuke Matsuda & Takao Yuyama - 2020 - Notre Dame Journal of Formal Logic 61 (4):591-600.details
|
|
Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms.Giuseppe Longo - 1983 - Annals of Pure and Applied Logic 24 (2):153.details
|
|
On church's formal theory of functions and functionals: The λ-calculus: connections to higher type recursion theory, proof theory, category theory.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.details
|
|
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.details
|
|
Combinatory Logic and the Semantics of Substructural Logics.Lou Goble - 2007 - Studia Logica 85 (2):171-197.details
|
|
Normalization without reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.details
|
|
Non-idempotent intersection types for the Lambda-Calculus.Antonio Bucciarelli, Delia Kesner & Daniel Ventura - 2017 - Logic Journal of the IGPL 25 (4):431-464.details
|
|
Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 1091--1132.details
|
|
Proof-functional connectives and realizability.Franco Barbanera & Simone Martini - 1994 - Archive for Mathematical Logic 33 (3):189-211.details
|
|
Domain theory in logical form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.details
|
|