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

264 Constructive mathematics and computer programming – P Martin-Lof - 1982
34 Partial objects in constructive type theory – R L Constable, S Smith - 1987
227 Une extension de l’interprétation de Gödel à l’analyse, et son application à l’élimination des coupures dans l’analyse et la théorie des types – Jean-Yves Girard - 1970
18 From Operational to Denotational Semantics – Scott Smith - 1989
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
56 A Non-Type-Theoretic Semantics for Type-Theoretic Language – S Allen - 1987
19 Partial Objects in Type Theory – Scott Fraser Smith - 1989
65 Recursive Definition in Type Theory – P Mendler - 1987
116 A syntactic theory of sequential control – M Felleisen, D P Friedman, E Kohlbecker, B Duba - 1987
395 LCF considered as a programming language – G Plotkin - 1977
96 Type Theory and Functional Programming – Simon Thompson, C Simon Thompson - 1991
91 A language and axioms for explicit mathematics – S Feferman - 1975
19 Partial Objects in the Calculus of Constructions – Philippe Audebaud - 1991
5 A theory of programs. unpublished notes – J W deBakker, D Scott - 1969
5 Admissibility of fixed-point induction in firstorder logic of typed theories – Shigeru Igarashi - 1974
69 Edinburgh LCF, A Mechanized Logic – M Gordon, R Milner, C Wadsworth - 1979
196 Mathematical theory of computation – Z Manna - 1974
167 Logic and Computation: Interactive Proof with Cambridge LCF – L C Paulson - 1987
5 An environment for automated reasoning about partial functions – David A Basin - 1988