Elementary complexity and geometry of interaction. (Extended abstract)

DOI10.1007/3-540-48959-2_4MaRDI QIDQ4263859zbMATH OpenFDO

Authors Patrick Baillot, Marco Pedicini

Publication date 28 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48959-2_4

zbMATH Keywords

algebra of clausesgeometry of interaction computationproofs of elementary linear logicresolutionweak execution

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Semantics in the theory of computing (68Q55)

Recommendations

• Elementary complexity and geometry of interaction
• scientific article; zbMATH DE number 785046
• scientific article; zbMATH DE number 4123722

Cited in

(5)

• Elementary complexity and geometry of interaction
• Memoryful geometry of interaction. II: Recursion and adequacy
• scientific article; zbMATH DE number 6917940 (Why is no real title available?)
• scientific article; zbMATH DE number 785046 (Why is no real title available?)
• Abstract machines, optimal reduction, and streams

This page was built for publication: Elementary complexity and geometry of interaction. (Extended abstract)

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