The following pages link to Robert L. Constable (Q1051423):
Displayed 50 items.
- (Q392278) (redirect page) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273) (← links)
- (Q865634) (redirect page) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- Computability concepts for programming language semantics (Q1235972) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Metalogical frameworks. II: Developing a reflected decision procedure (Q1283204) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- Writing programs that construct proofs (Q1820596) (← links)
- Subrecursive programming languages. II. On program size (Q2546770) (← links)
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259) (← links)
- Implementing Euclid's straightedge and compass constructions in type theory (Q2631963) (← links)
- (Q2723417) (← links)
- (Q2752048) (← links)
- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language (Q2947456) (← links)
- On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer (Q2986777) (← links)
- Knowledge-Based Synthesis of Distributed Systems Using Event Structures (Q3003333) (← links)
- Russell's Orders in Kripke's Theory of Truth and Computational Type Theory (Q3166620) (← links)
- Proofs as programs (Q3219093) (← links)
- (Q3319764) (← links)
- (Q3484381) (← links)
- Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics (Q3535610) (← links)
- Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics (Q3613407) (← links)
- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge (Q3644710) (← links)
- The Type Theory of PL/CV3 (Q3673081) (← links)
- (Q3687706) (← links)
- (Q3702502) (← links)
- (Q3875311) (← links)
- On the Computational Complexity of Program Scheme Equivalence (Q3893301) (← links)
- A Hierarchical Approach to Formal Semantics With Application to the Definition of PL/ CS (Q3914397) (← links)
- (Q3922177) (← links)
- (Q4012886) (← links)
- (Q4062633) (← links)
- (Q4125721) (← links)
- (Q4131618) (← links)
- (Q4138096) (← links)
- (Q4195920) (← links)
- (Q4215639) (← links)
- (Q4261732) (← links)
- (Q4263836) (← links)
- (Q4357062) (← links)
- (Q4664919) (← links)
- (Q4740562) (← links)
- (Q4742765) (← links)
- (Q4793030) (← links)
- (Q4823137) (← links)
- (Q4842534) (← links)
- (Q4981439) (← links)