Compact Normalisation Trace via Lazy Rewriting (2001)

Cached

Download Links

by Quang-Huy Nguyen , Loria Inria
Citations:6 - 0 self

Documents Related by Co-Citation

69 Context-Sensitive Computations in Functional and Functional Logic Programs – Salvador Lucas - 1998
30 Termination of on-demand rewriting and termination of OBJ programs – Salvador Lucas - 2001
23 Lazy rewriting on eager machinery – Wan Fokkink, Pum Walters, Jasper Kamperman - 2000
89 should not evaluate its arguments – D P Friedman, D S Wise, CONS - 1976
944 Term Rewriting and All That – Franz Baader, Tobias Nipkow - 1998
33 Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages – Jürgen Giesl, Stephan Swiderski, René Thiemann - 2006
17 The Evaluation Strategy for Head Normal Form With and Without on-Demand Flags – Masaki Nakamura, Kazuhiro Ogata - 2001
25 Transforming Context-Sensitive Rewrite Systems – Jürgen Giesl , Aart Middeldorp - 1999
3 On-demand strategy annotations revisited – M Alpuente, S Escobar, B Gramlich, S Lucas - 2003
2 On context-sensitive term rewriting – F Schernhammer - 2007
23 Polynomials for Proving Termination of Context-Sensitive Rewriting – Salvador Lucas - 2004
13 Lazy Rewriting and Context-Sensitive Rewriting – Salvador Lucas - 2002
22 Classes of equational programs that compile into efficient machine code – R Strandh - 1989
130 Eekelen. Functional Programming and Parallel Graph Rewriting – R Plasmeijer, M van - 1993
87 A lazy evaluator – P Henderson, J James H Morris - 1976
90 AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework – Jürgen Giesl, Peter Schneider-kamp, René Thiemann - 2006
32 Termination of Context-Sensitive Rewriting – H. Zantema - 1997
12 Operational semantics of rewriting with the on-demand evaluation strategy, in – K Ogata, K Futatsugi - 2000
25 An overview of CAFE specification environment – an algebraic approach for creating, verifying, and maintaining formal specifications over networks – K Futatsugi, A Nakagawa - 1997