A New Translation for Semi-classical Theories — Backtracking without CPS

DOI10.1007/978-3-540-78969-7_16zbMath1138.68026OpenAlexW4245030848MaRDI QIDQ5458438

Satoshi Kobayashi

Publication date: 11 April 2008

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78969-7_16

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games with 1-backtracking
• Mathematics based on incremental learning -- excluded middle and inductive inference
• Constructivism in mathematics. An introduction. Volume II
• Realizability interpretation of generalized inductive definitions
• Some intuitionistic equivalents of classical principles for degree 2 formulas
• A sequent calculus for limit computable mathematics
• Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
• A semantics of evidence for classical arithmetic
• Automata, Languages and Programming

This page was built for publication: A New Translation for Semi-classical Theories — Backtracking without CPS