Comparing hierarchies of types in models of linear logic

DOI10.1016/j.ic.2003.10.003zbMath1052.03038OpenAlexW2016951437MaRDI QIDQ1881220

Paul-André Melliès

Publication date: 4 October 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2003.10.003

zbMATH Keywords

monoidal categoriesmodels of linear logiccoherence space modelextensional hierarchy of typesgames semantics

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (8)

Unnamed Item ⋮ Multigames and strategies, coalgebraically ⋮ Unnamed Item ⋮ Interpreting Localized Computational Effects Using Operators of Higher Type ⋮ Some Programming Languages Suggested by Game Models (Extended Abstract) ⋮ Non-uniform (hyper/multi)coherence spaces ⋮ Monoidal-closed categories of tree automata ⋮ Sequential algorithms and strongly stable functions

Cites Work

• Linear logic
• Sequential algorithms on concrete data structures
• Fully abstract semantics for observably sequential languages
• Parallel and serial hypercoherences
• Combining a monad and a comonad
• The sequentially realizable functionals
• On full abstraction for PCF: I, II and III
• The formal theory of monads
• Localisation and interaction in one dimension
• Games and full completeness for multiplicative linear logic
• On the symmetry of sequentiality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing hierarchies of types in models of linear logic