Partial computations in constructive type theory (1991)

Cached

Download Links

by Scott F. Smith
Venue:JOURNAL OF LOGIC AND COMPUTATION
Citations:7 - 5 self

Documents Related by Co-Citation

235 Constructive mathematics and computer programming – Per Martin-Lof - 1982
32 Partial Objects in Constructive Type Theory – Robert L Constable, Scott Fraser Smith - 1987
195 Une extension de l'interpr'etation de Godel `a l'analyse, et son application `a l"elimination des coupures dans l'analyse et la th'eorie des types – J-Y Girard - 1971
17 From Operational to Denotational Semantics – Scott Smith - 1989
219 Call-by-name, call-by-value, and the -calculus – G D Plotkin - 1975
55 A non-type-theoretic semantics for type-theoretic language – S Allen - 1987
18 Partial Objects in Type Theory – Scott Fraser Smith - 1989
57 Inductive Definition in Type Theory – Nax Paul Mendler - 1988
105 A Syntactic Theory of Sequential Control – M Felleisen, D P Friedman, E E Kohlbecker, B F Duba - 1987
363 LCF considered as a programming language – Gordon D Plotkin - 1977
87 Type Theory and Functional Programming – Simon Thompson, C Simon Thompson - 1991
87 A language and axioms for explicit mathematics – S Feferman
18 Partial Objects in the Calculus of Constructions – Philippe Audebaud - 1991
4 Admissibility of fixed-point induction in first-order logic of typed theories – S Igarashi - 1972
5 A theory of programs. unpublished notes – J W deBakker, D Scott - 1969
69 Edinburgh LCF: A Mechanized Logic – Michael J Gordon, Robin Milner, Christopher P Wadsworth - 1979
157 Logic and Computation: Interactive proof with Cambridge LCF – Lawrence C Paulson - 1987
173 Mathematical Theory of Computation – Z MANNA - 1974
5 An environment for automated reasoning about partial functions – David A Basin - 1988