An equational presentation of higher order logic-Reference-Cited by-同舟云学术

An equational presentation of higher order logic

Published:1987 Issue: Volume: Page:40-56
ISSN:0302-9743
Container-title:Category Theory and Computer Science
language:
Short-container-title:

Author:

Coquand Thierry,Ehrhard Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-18508-9_19.pdf

Reference29 articles.

1. Berry, G. “Stable models of the typed λ-calculi” ICALP, Springer-Verlag, LNCS 62, 1978 pp. 72–89

2. V. Breazu-Tannen and A. Meyer. “Lambda Calculus with Constrained Types” Abstract (1985)

3. A. Burroni. “Algèbres graphiques” Cahiers de Topologie et Geometrie Differentielle Volume XXII-3 1981

4. G. Cousineau, P.L. Curien and M. Mauny. “The Categorical Abstract Machine.” In Functional Programming Languages and Computer Architecture, Ed. J. P. Jouannaud, Springer-Verlag LNCS 201 (1985) 50–64.

5. T. Coquand, C. Gunter, G. Winskel. “Polymorphism and domain equations” Technical report Cambridge no 107.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rewriting properties of combinators for rudimentary linear logic;Higher-Order Algebra, Logic, and Term Rewriting;1994

2. Categorical models for non-extensional λ-calculi and combinatory logic;Mathematical Structures in Computer Science;1992-09

3. E-CCC: between CCC and topos, — its expressive power from the viewpoint of data type theory;Journal of Symbolic Computation;1989-12

4. Alpha-conversion, conditions on variables and categorical logic;Studia Logica;1989-09

5. Foundations are rich institutions, but institutions are poor foundations;Categorical Methods in Computer Science With Aspects from Topology;1989