Type Theoretic Properties of Assignments

[1]  John C. Mitchell,et al.  The essence of ML , 1988, POPL '88.

[2]  Philip Wadler,et al.  Is there a use for linear logic? , 1991, PEPM '91.

[3]  Fa Dick.  The mathematical language AUTOMATH, its usage and some of its extensions , 1970 .

[4]  S. Hayashi,et al.  PX, a computational logic , 1988 .

[5]  John C. Mitchell,et al.  Type Systems for Programming Languages , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[7]  Christine Mohring,et al.  Algorithm Development in the Calculus of Constructions , 1986, Logic in Computer Science.

[8]  Paul Hudak Raman S. Sundaresh.  On the Expressiveness of Purely Functional I/O Systems , 1989 .

[9]  P. Mendler.  Inductive Definition in Type Theory , 1988 .

[10]  Vipin Swarup,et al.  A Logical View of Assignments , 1991, Constructivity in Computer Science.

[11]  Thierry Coquand.  On the analogy between propositions and types , 1986 .

[12]  Carolyn L. Talcott,et al.  Axiomatizing operational equivalence in the presence of side effects , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[13]  Philip Wadler,et al.  Linear Types can Change the World! , 1990, Programming Concepts and Methods.

[14]  Jan M. Smith.  The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example , 1983, FCT.

[15]  Scott F. Smith.  Partial Objects in Type Theory , 1988 .

[16]  Paul Hudak,et al.  Single-threaded polymorphic lambda calculus , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[17]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[18]  S. Feferman.  A Language and Axioms for Explicit Mathematics , 1975 .

[19]  John C. Reynolds,et al.  Preliminary design of the programming language Forsythe , 1988 .

[20]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[21]  David K. Gifford,et al.  Polymorphic effect systems , 1988, POPL '88.

[22]  David K. Gifford,et al.  Integrating functional and imperative programming , 1986, LFP '86.

[23]  Bengt Nordström,et al.  Programming in Constructive Set Theory: Some examples , 1981, FPCA '81.

[24]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[25]  Philip Wadler,et al.  Comprehending monads , 1990, LISP and Functional Programming.

[26]  Robin Milner,et al.  Definition of standard ML , 1990 .

[27]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[28]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[29]  J. Gallier.  On Girard's "Candidats de Reductibilité" , 1989 .

[30]  Raymond Turner,et al.  A Constructive Set Theory for Program Development , 1988, FSTTCS.

[31]  John C. Reynolds,et al.  Three Approaches to Type Structure , 1985, TAPSOFT, Vol.1.

[32]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[33]  W. Tait.  A realizability interpretation of the theory of species , 1975 .

[34]  M. Tofte.  Operational Semantics and Polymorphic Type Inference , 1988 .

[35]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[36]  J. Girard,et al.  Proofs and types , 1989 .

[37]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[38]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[39]  M. Felleisen.  lambda-V-CS: An Extended lambda-Calculus for Scheme. , 1988 .

[40]  Grażyna Mirkowska-Salwicka,et al.  Algorithmic Logic , 1987 .

[41]  Gary Lindstrom,et al.  Functional programing and the logical variable , 1985, POPL.

[42]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[43]  Robert Hieb,et al.  The Revised Report on the Syntactic Theories of Sequential Control and State , 1992, Theor. Comput. Sci..

[44]  John C. Mitchell,et al.  Abstract types have existential types , 1985, POPL.

[45]  Matthias Felleisen,et al.  A calculus for assignments in higher-order languages , 1987, POPL '87.

[46]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[47]  John Hughes,et al.  Why Functional Programming Matters , 1989, Comput. J..

[48]  Robert L. Constable,et al.  Partial Objects In Constructive Type Theory , 1987, Logic in Computer Science.

[49]  Per Martin-Löf,et al.  Constructive mathematics and computer programming , 1984 .

[50]  Vipin Swarup,et al.  Assignments for Applicative Languages , 1991, FPCA.

[51]  John McCarthy,et al.  Mathematical Theory of Computation , 1991 .

[52]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[53]  P. Martin-Löf.  An Intuitionistic Theory of Types: Predicative Part , 1975 .

[54]  Robert L. Constable,et al.  Infinite Objects in Type Theory , 1986, LICS.

[55]  William D. Clinger,et al.  Revised3 report on the algorithmic language scheme , 1986, SIGP.

[56]  Samson Abramsky,et al.  Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..

[57]  David H. D. Warren,et al.  Prolog - the language and its implementation compared with Lisp , 1977, Artificial Intelligence and Programming Languages.

[58]  Thierry Coquand,et al.  Constructions: A Higher Order Proof System for Mechanizing Mathematics , 1985, European Conference on Computer Algebra.

[59]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[60]  Ian A. Mason,et al.  A Sound and Complete Axiomatization of OperationalEquivalence between Programs with Memory , 1989 .

[61]  David B. MacQueen.  Modules for standard ML , 1984, LFP '84.

[62]  David A. Schmidt.  Detecting global variables in denotational specifications , 1985, TOPL.

[63]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[64]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[65]  Butler W. Lampson,et al.  A Kernel Language for Abstract Data Types and Modules , 1984, Semantics of Data Types.

[66]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[67]  Paul Hudak,et al.  The aggregate update problem in functional programming systems , 1985, POPL.

[68]  Per Martin-Löf,et al.  Intuitionistic type theory , 1984, Studies in proof theory.