12 results
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM
-
- Journal:
- Journal of Functional Programming / Volume 33 / 2023
- Published online by Cambridge University Press:
- 06 March 2023, e3
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Folding left and right matters: Direct style, accumulators, and continuations
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 33 / 2023
- Published online by Cambridge University Press:
- 14 February 2023, e2
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 32 / 2022
- Published online by Cambridge University Press:
- 29 September 2022, e13
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Folding left and right over Peano numbers
- Part of
-
- Journal:
- Journal of Functional Programming / Volume 29 / 2019
- Published online by Cambridge University Press:
- 17 April 2019, e6
-
- Article
-
- You have access
- Export citation
THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
-
- Journal:
- Journal of Functional Programming / Volume 16 / Issue 3 / May 2006
- Published online by Cambridge University Press:
- 25 October 2016, pp. 269-280
-
- Article
-
- You have access
- Export citation
On one-pass CPS transformations
-
- Journal:
- Journal of Functional Programming / Volume 17 / Issue 6 / November 2007
- Published online by Cambridge University Press:
- 01 November 2007, pp. 793-812
-
- Article
-
- You have access
- Export citation
Syntactic accidents in program analysis: on the impact of the CPS transformation
-
- Journal:
- Journal of Functional Programming / Volume 13 / Issue 5 / September 2003
- Published online by Cambridge University Press:
- 27 August 2003, pp. 867-904
-
- Article
-
- You have access
- Export citation
CPS transformation of flow information, Part II: administrative reductions
-
- Journal:
- Journal of Functional Programming / Volume 13 / Issue 5 / September 2003
- Published online by Cambridge University Press:
- 27 August 2003, pp. 925-933
-
- Article
-
- You have access
- Export citation
Normalization by evaluation with typed abstract syntax
-
- Journal:
- Journal of Functional Programming / Volume 11 / Issue 6 / November 2001
- Published online by Cambridge University Press:
- 28 November 2001, pp. 673-680
-
- Article
-
- You have access
- Export citation
Functional unparsing
-
- Journal:
- Journal of Functional Programming / Volume 8 / Issue 6 / November 1998
- Published online by Cambridge University Press:
- 01 November 1998, pp. 621-625
-
- Article
-
- You have access
- Export citation
A computational formalization for partial evaluation
-
- Journal:
- Mathematical Structures in Computer Science / Volume 7 / Issue 5 / October 1997
- Published online by Cambridge University Press:
- 01 October 1997, pp. 507-541
-
- Article
- Export citation
Thunks and the λ-calculus
-
- Journal:
- Journal of Functional Programming / Volume 7 / Issue 3 / May 1997
- Published online by Cambridge University Press:
- 01 May 1997, pp. 303-319
-
- Article
-
- You have access
- Export citation