Beating the Productivity Checker Using Embedded Languages

by Nils Anders Danielsson
Citations:6 - 3 self

Documents Related by Co-Citation

40 Programming in Haskell – G Hutton - 2007
83 Infinite Objects in Type Theory – Thierry Coquand
5 Trace-based coinductive operational semantics for While; Big-step and small-step, relational and functional styles – Keiko Nakata, Tarmo Uustalu - 2009
50 Techniques of “weak bisimulation up to – D Sangiorgi, R Milner - 1992
29 General recursion via coinductive types – Venanzio Capretta
7 Termination checking in the presence of nested inductive and coinductive types. Note supporting presentation given at the Workshop on Partiality and Recursion in Interactive Theorem Provers – Thorsten Altenkirch, Nils Anders Danielsson - 2009
168 Towards a practical programming language based on dependent type theory – Ulf Norell - 2007
5 Danielsson, Thorsten Altenkirch, Mixing induction and coinduction – Nils Anders - 2009
66 A Categorical Programming Language – Tatsuya Hagino, Tatsuya Hagino - 1987
59 On the semantics of fair parallelism – D Park - 1980
15 Representations of stream processors using nested fixed points – Peter Hancock, Dirk Pattinson, Neil Ghani
65 Recursive Definition in Type Theory – P Mendler - 1987
4 A metric model of guarded recursion – L Birkedal, J Schwinghammer, K Stvring - 2010
4 Concrete Stream Calculus: An Extended Study – Ralf Hinze - 2010
2 Infinite Objects in Type Theory. Pages 62–78 of – Thierry Coquand - 1994
2 Ultrametric Semantics of Reactive Programs. Pages 257–266 of – Neelakantan R Krishnaswami, Nick Benton - 2011
2 Tomorrow is Another Day. Talk given at the – Conor McBride - 2011
2 Real-Time Systems – Hybrid
2 Ensuring Streams Flow. Pages 509–523 of: Algebraic Methodology and Software Technology – Alastair Telford, David Turner - 1997