The clocks are ticking: No more delays!

Guarded recursion in the sense of Nakano allows general recursive types and terms to be added to type theory without breaking consistency. Recent work has demonstrated applications of guarded recursion such as programming with codata, reasoning about coinductive types, as well as constructing and reasoning about denotational models of general recursive types. Guarded recursion can also be used as an abstract form of step-indexing for reasoning about programming languages with advanced features.

[1]  Rasmus Ejlers Møgelberg,et al.  Denotational semantics of recursive types in synthetic guarded domain theory , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[2]  Bas Spitters,et al.  Guarded Cubical Type Theory: Path Equality for Guarded Recursion , 2016, CSL.

[3]  Brigitte Pientka,et al.  Well-founded recursion with copatterns and sized types , 2016, Journal of Functional Programming.

[4]  Rasmus Ejlers Møgelberg,et al.  Guarded Dependent Type Theory with Coinductive Types , 2016, FoSSaCS.

[5]  Thierry Coquand,et al.  Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom , 2015, TYPES.

[6]  Hans Bugge Grathwohl,et al.  Programming and Reasoning with Guarded Recursion for Coinductive Types , 2015, FoSSaCS.

[7]  Andreas Abel,et al.  A Formalized Proof of Strong Normalization for Guarded Recursive Types , 2014, APLAS.

[8]  Rasmus Ejlers Møgelberg.  A type theory for productive coprogramming via guarded recursion , 2014, CSL-LICS.

[9]  Alan Jeffrey,et al.  Functional reactive types , 2014, CSL-LICS.

[10]  Lars Birkedal,et al.  A Model of Countable Nondeterminism in Guarded Type Theory , 2014, RTA-TLCA.

[11]  Lars Birkedal,et al.  Impredicative Concurrent Abstract Predicates , 2014, ESOP.

[12]  Prakash Panangaden,et al.  Fair reactive programming , 2014, POPL.

[13]  Robert Atkey,et al.  Productive coprogramming with guarded recursion , 2013, ICFP.

[14]  Neelakantan R. Krishnaswami,et al.  Higher-order functional reactive programming without spacetime leaks , 2013, ICFP.

[15]  Brigitte Pientka,et al.  Copatterns: programming infinite structures by observations , 2013, POPL.

[16]  Paula Severi,et al.  Pure type systems with corecursion on streams: from finite to infinitary normalisation , 2012, ICFP.

[17]  James Cheney,et al.  A dependent nominal type theory , 2012, Log. Methods Comput. Sci..

[18]  Rasmus Ejlers Møgelberg,et al.  First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[19]  Nils Anders Danielsson.  Beating the Productivity Checker Using Embedded Languages , 2010, PAR@ITP.

[20]  M. J. Frade,et al.  Type-based termination of recursive definitions , 2004 .

[21]  Andrew W. Appel,et al.  An indexed model of recursive types for foundational proof-carrying code , 2001, TOPL.

[22]  Hiroshi Nakano,et al.  A modality for recursion , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[23]  Robert Harper,et al.  Constructing Type Systems over an Operational Semantics , 1992, J. Symb. Comput..

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

[25]  Masako Takahashi,et al.  Parallel reductions in λ-calculus (revised version) , 1992 .

[26]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[27]  P. Bahr,et al.  The Clocks Are Ticking : No More Delays ! ( technical appendix ) , 2017 .

[28]  Amr Sabry,et al.  Proving the correctness of reactive systems using sized types , 1996, POPL '96.

[29]  J. Gallier,et al.  A Proof of Strong Normalization for the Theor y of Constructions Using a Kripke-like Interpretation , 1990 .