7 results
Normalization by evaluation for modal dependent type theory
-
- Journal:
- Journal of Functional Programming / Volume 33 / 2023
- Published online by Cambridge University Press:
- 02 October 2023, e7
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
POPLMark reloaded: Mechanizing proofs by logical relations
-
- Journal:
- Journal of Functional Programming / Volume 29 / 2019
- Published online by Cambridge University Press:
- 10 December 2019, e19
-
- Article
-
- You have access
- Export citation
A case study in programming coinductive proofs: Howe’s method
-
- Journal:
- Mathematical Structures in Computer Science / Volume 29 / Issue 8 / September 2019
- Published online by Cambridge University Press:
- 31 October 2018, pp. 1309-1343
-
- Article
-
- You have access
- Export citation
Mechanizing proofs with logical relations – Kripke-style
-
- Journal:
- Mathematical Structures in Computer Science / Volume 28 / Issue 9 / October 2018
- Published online by Cambridge University Press:
- 02 August 2018, pp. 1606-1638
-
- Article
- Export citation
Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions
-
- Journal:
- Mathematical Structures in Computer Science / Volume 28 / Issue 9 / October 2018
- Published online by Cambridge University Press:
- 05 May 2017, pp. 1507-1540
-
- Article
- Export citation
Well-founded recursion with copatterns and sized types
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 26 / 2016
- Published online by Cambridge University Press:
- 03 March 2016, e2
-
- Article
-
- You have access
- Export citation
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 23 / Issue 1 / January 2013
- Published online by Cambridge University Press:
- 02 November 2012, pp. 1-37
-
- Article
-
- You have access
- Export citation