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-Löf - 1979
34 Partial objects in constructive type theory – R L Constable, S Smith - 1987
227 Une extension de L'interpretation 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
18 From Operational to Denotational Semantics – Scott Smith - 1989
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
55 A Non-Type-Theoretic Semantics for TypeTheoretic 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 – Matthias Felleisen, Daniel P Friedman, E Kohlbecker, B F Duba - 1987
394 LCF considered as a programming language – G D Plotkin - 1977
96 Type Theory and Functional Programming – Simon Thompson, C Simon Thompson - 1991
90 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
193 Mathematical Theory of Computation – Zohar Manna - 2003
165 Logic and Computation: Interactive Proof with Cambridge LCF – L Paulson - 1987
5 An environment for automated reasoning about partial functions – David A Basin - 1988