Foundations of Software Science and Computation Structures
From MaRDI portal
Publication:5308440
DOI10.1007/b95995zbMath1126.03306OpenAlexW3105029025MaRDI QIDQ5308440
Patrick Baillot, Virgile Mogbil
Publication date: 28 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95995
Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)
Related Items (9)
A Characterization of NC k by First Order Functional Programs ⋮ Natural language semantics and computability ⋮ Soft linear set theory ⋮ Gödel's system \(\mathcal T\) revisited ⋮ Realizability models and implicit complexity ⋮ Resource control for synchronous cooperative threads ⋮ Quantum implicit computational complexity ⋮ Quantitative classical realizability ⋮ Implicit computation complexity in higher-order programming languages
This page was built for publication: Foundations of Software Science and Computation Structures
