scientific article; zbMATH DE number 4006266
From MaRDI portal
Publication:3757915
Recommendations
Cited in
(32)- Full operational set theory with unbounded existential quantification and power set
- Proving properties of Pascal programs in MIZAR 2
- Realizability interpretation of generalized inductive definitions
- Proofs and programs
- Theories with self-application and computational complexity.
- Writing programs that construct proofs
- Towards a computation system based on set theory
- Applicative theories for logarithmic complexity classes
- On Feferman's operational set theory \textsf{OST}
- Proof checking and logic programming
- Combining programming with theorem proving
- Proofs as programs
- Programming as a mathematical exercise
- Proof of Correctness of Decision Table Programs
- scientific article; zbMATH DE number 3859117 (Why is no real title available?)
- scientific article; zbMATH DE number 4147469 (Why is no real title available?)
- scientific article; zbMATH DE number 3952752 (Why is no real title available?)
- A Proof-Theoretic Account of Programming and the Role of Reduction Rules
- Operational closure and stability
- From programming-by-example to proving-by-example
- scientific article; zbMATH DE number 3894466 (Why is no real title available?)
- What Is the Difference Between Proofs and Programs?
- Type theory and proof processing systems
- Proving and programming
- Explicit mathematics: power types and overloading
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- The provably terminating operations of the subsystem PETJ of explicit mathematics
- Proof methods of declarative properties of definite programs
- A proof-theoretic characterization of the basic feasible functionals
- The mathematical construction of a program
- Formal proof of a program: find
- Partial Horn logic and Cartesian categories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757915)
