Mathematical Structures in Computer Science · 2017 · 76 citations · 20 references
ComputingComputer ScienceLogicSemanticsTheory Of ComputationFormal SemanticsModel TheoryRelational AlgebraSyntax-semantics InterfaceType CheckingType SystemsDenotational ModelsExecution Time AnalysisIntersection TypesLambda CalculusLambda Calculus SemanticsRelational SemanticsTyped Lambda Calculus
The multiset-based relational model of linear logic induces a semantics of the untyped λ-calculus, which corresponds with a non-idempotent intersection type system, System R . We prove that, in System R , the size of type derivations and the size of types are closely related to the execution time of λ-terms in a particular environment machine, Krivine's machine.
20
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
CATEGORIES FOR THE WORKING MATHEMATICIAN
A. Bowtell · Bulletin of the London Mathematical Society · 1974 · 1.3K citations
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11
Harold T. Hodes, Henk Barendregt · The Philosophical Review · 1988 · 567 citations
The system F of variable types, fifteen years later
Jean-Yves Girard · Theoretical Computer Science · 1986 · 356 citations