Lambda calculus and intuitionistic linear logic

DOI10.1023/A:1005092630115zbMath0894.03013OpenAlexW1582221715MaRDI QIDQ1378432

Luca Roversi, Simonetta Ronchi della Rocca

Publication date: 11 February 1998

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005092630115

zbMATH Keywords

natural deductiontyped lambda calculuscategorical modelCurry-Howard IsomorphismIntuitionistic Linear Logictyped functional languagetyped functional programming

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)

Related Items (8)

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus ⋮ Resource operators for \(\lambda\)-calculus ⋮ New Curry-Howard terms for full linear logic ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Three faces of natural deduction ⋮ Unnamed Item ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Factorization in call-by-name and call-by-value calculi via linear logic

This page was built for publication: Lambda calculus and intuitionistic linear logic