Monotone (co)inductive types and positive fixed-point types
RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 309-328
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Efficient lambda encodings for Mendler-style coinductive types in Cedille
Christopher Jenkins, Aaron Stump and Larry DiehlElectronic Proceedings in Theoretical Computer Science 317 72 (2020)
https://doi.org/10.4204/EPTCS.317.5
Algebras and coalgebras in the light affine Lambda calculus
Marco Gaboardi and Romain PéchouxACM SIGPLAN Notices 50 (9) 114 (2015)
https://doi.org/10.1145/2858949.2784759
Some Remarks on Type Systems for Course-of-value Recursion
Favio Ezequiel Miranda-PereaElectronic Notes in Theoretical Computer Science 247 103 (2009)
https://doi.org/10.1016/j.entcs.2009.07.051
Two extensions of system F with (co)iteration and primitive (co)recursion principles
Favio Ezequiel Miranda-PereaRAIRO - Theoretical Informatics and Applications 43 (4) 703 (2009)
https://doi.org/10.1051/ita/2009015
Lectures on the Curry-Howard Isomorphism
M.H. Sørensen and P. UrzyczynStudies in Logic and the Foundations of Mathematics, Lectures on the Curry-Howard Isomorphism 149 403 (2006)
https://doi.org/10.1016/S0049-237X(06)80018-2
Iteration and coiteration schemes for higher-order and nested datatypes
Andreas Abel, Ralph Matthes and Tarmo UustaluTheoretical Computer Science 333 (1-2) 3 (2005)
https://doi.org/10.1016/j.tcs.2004.10.017
Realizability for Monotone and Clausular (Co)inductive Definitions
Favio E. Miranda-PereaElectronic Notes in Theoretical Computer Science 123 179 (2005)
https://doi.org/10.1016/j.entcs.2004.04.048
Typed Lambda Calculi and Applications
Ralph MatthesLecture Notes in Computer Science, Typed Lambda Calculi and Applications 2044 329 (2001)
https://doi.org/10.1007/3-540-45413-6_26
Theorem Proving in Higher Order Logics
Venanzio CaprettaLecture Notes in Computer Science, Theorem Proving in Higher Order Logics 1869 73 (2000)
https://doi.org/10.1007/3-540-44659-1_5