Proofs, tests and continuation passing style

DOI10.1145/1462179.1462184zbMath1351.68058OpenAlexW2112607161MaRDI QIDQ2946570

Stefano Guerrini, Andrea Masini

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1462179.1462184

zbMATH Keywords

linear logicintuitionistic logiclambda calculusminimal logiccall-by-valuecall-by-namecontinuations passing style

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Proof nets for classical logic

This page was built for publication: Proofs, tests and continuation passing style