scientific article; zbMATH DE number 515728

MaRDI QIDQ4283230zbMATH OpenFDO

Authors Nick Benton, Gavin M. Bierman, Martin Hyland, Valeria de Paiva

Publication date 1 July 1996

zbMATH Keywords

intuitionistic linear logicmultiplicative conjunctionmultiplicative exponential linear logic

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40) Categorical logic, topoi (03G30)

Cited in

(21)

• Synthetic domain theory and models of linear Abadi {\&} Plotkin logic
• Experiments in linear natural deduction
• Three faces of natural deduction
• When programs have to watch paint dry
• Natural deduction for intuitionistic linear logic
• Nominal Domain Theory for Concurrency
• Prime algebraicity
• Comonadic notions of computation
• Glueing and orthogonality for models of linear logic
• A categorical reduction system for linear logic
• Domain theory for concurrency
• Proof theory in the abstract
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• Linearity, control effects, and behavioral types
• Multiplicative linear logics and fibrations
• Hypernormalisation in an abstract setting
• Relating state-based and process-based concurrency through linear logic (full-version)
• Deriving distributive laws for graded linear types
• Categorical models of the differential λ-calculus
• Proof-search in type-theoretic languages: An introduction
• Relating state-based and process-based concurrency through linear logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283230)