`Travelled to:`

1 × Croatia

1 × France

1 × United Kingdom

14 × USA

`Collaborated with:`

∅ S.F.Smith W.Moczydlowski T.B.Knoblock S.Johnson H.Egli S.S.Muchnick J.Hartmanis S.F.Allen C.Kreitz N.P.Mendler P.Panangaden D.J.Howe W.E.Aitken R.Eaton L.Lorigo X.Liu R.v.Renesse J.Hickey M.Hayden K.P.Birman

`Talks about:`

theori (7) program (5) comput (5) type (5) formal (4) construct (3) semant (3) subrecurs (2) schemata (2) problem (2)

## Person: Robert L. Constable

### DBLP: Constable:Robert_L=

### Facilitated 2 volumes:

### Contributed to:

### Wrote 19 papers:

- LICS-2012-Constable #on the
- On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer (RLC), pp. 2–8.
- IJCAR-2006-ConstableM #proving #semantics #source code
- Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics (RLC, WM), pp. 162–176.
- CADE-2000-AllenCEKL #logic
- The Nuprl Open Logical Environment (SFA, RLC, RE, CK, LL), pp. 170–176.
- SOSP-1999-LiuKRHHBC #communication #component #reliability
- Building reliable, high-performance communication systems from components (XL, CK, RvR, JH, MH, KPB, RLC), pp. 80–92.
- LICS-1995-Constable #experience #type system
- Experience with Type Theory as a Foundation for Computer Science (RLC), pp. 266–279.
- CADE-1994-Constable
- Exporting and Refecting Abstract Metamathematics (RLC), p. 529.
- LICS-1990-AllenCHA #proving #semantics
- The Semantics of Reflected Proof (SFA, RLC, DJH, WEA), pp. 95–105.
- LICS-1988-ConstableS #recursion
- Computational Foundations of Basic Recursive Function Theory (RLC, SFS), pp. 360–371.
- LICS-1987-ConstableS #type system
- Partial Objects In Constructive Type Theory (RLC, SFS), pp. 183–193.
- LICS-1986-KnoblockC #type system
- Formalized Metareasoning in Type Theory (TBK, RLC), pp. 237–248.
- LICS-1986-MendlerPC #infinity #type system
- Infinite Objects in Type Theory (NPM, PP, RLC), pp. 249–255.
- POPL-1979-ConstableJ
- A PL/CV Precis (RLC, SJ), pp. 7–20.
- STOC-1977-Constable #formal method #logic #on the #programming
- On the Theory of Programming Logics (RLC), pp. 269–285.
- STOC-1975-EgliC #concept #programming language #semantics
- Computability Concepts for Programming Language Semantics (HE, RLC), pp. 98–106.
- STOC-1973-Constable #complexity
- Type Two Computational Complexity (RLC), pp. 108–121.
- STOC-1972-ConstableM #decidability #equivalence #problem #recursion
- Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.
- STOC-1971-Constable
- Loop Schemata (RLC), pp. 24–39.
- STOC-1971-ConstableH #complexity
- Complexity of Formal Translations and Speed-Up Results (RLC, JH), pp. 244–250.
- STOC-1970-Constable #on the #recursion #source code
- On the Size of Programs in Subrecursive Formalisms (RLC), pp. 1–9.