|
|
PAR-10: Author IndexAuthor | Papers |
---|
A | Abel, Andreas | MiniAgda: Integrating Sized and Dependent Types | Altenkirch, Thorsten | Termination Checking in the Presence of Nested Inductive and Coinductive Types | B | Butler, Michael | Rewriting and Well-Definedness within a Proof System | D | Danielsson, Nils Anders | Beating the Productivity Checker Using Embedded Languages Termination Checking in the Presence of Nested Inductive and Coinductive Types | H | Hamilton, Geoff | Cyclic Proofs and Coinductive Principles | K | Krauss, Alexander | Recursive Definitions of Monadic Functions | M | Maamria, Issam | Rewriting and Well-Definedness within a Proof System | Mcbride, Conor | Djinn, Monotonic | Mendel-Gleason, Gavin | Cyclic Proofs and Coinductive Principles | S | Sacerdoti Coen, Claudio | General Recursion and Formal Topology | Sjöberg, Vilhelm | Termination Casts: A Flexible Approach to Termination with General Recursion | Stump, Aaron | Termination Casts: A Flexible Approach to Termination with General Recursion | U | Uustalu, Tarmo | Antifounded Coinduction in Type Theory | V | Valentini, Silvio | General Recursion and Formal Topology | W | Weirich, Stephanie | Termination Casts: A Flexible Approach to Termination with General Recursion |
|
|
|