6th International Workshop on Higher-Order Rewriting

[1]  R. J. M. Hughes,et al.  Super-combinators a new implementation method for applicative languages , 1982, LFP '82.

[2]  J. Roger Hindley,et al.  Combinatory Weak Reduction in Lambda Calculus , 1998, Theor. Comput. Sci..

[3]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[4]  Luc Maranget,et al.  Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems , 1991, POPL '91.

[5]  John Launchbury,et al.  A natural semantics for lazy evaluation , 1993, POPL '93.

[6]  H. J. Sander Bruggink.  Residuals in Higher-Order Rewriting , 2003, RTA.

[7]  Luc Maranget,et al.  SHARING IN THE WEAK LAMBDA-CALCULUS REVISITED , 2007 .

[8]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[9]  Matthias Felleisen,et al.  A call-by-need lambda calculus , 1995, POPL '95.

[10]  Matthias Felleisen,et al.  The call-by-need lambda calculus , 1997, Journal of Functional Programming.

[11]  Terese.  Term rewriting systems , 2003, Cambridge tracts in theoretical computer science.

[12]  Thibaut Balabonski,et al.  A unified approach to fully lazy sharing , 2012, POPL '12.

[13]  Luigi Liquori,et al.  Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract , 2005, TERMGRAPH.

[14]  Ugo Dal Lago,et al.  On Constructor Rewrite Systems and the Lambda-Calculus , 2009, ICALP.

[15]  Peter Sestoft,et al.  Deriving a lazy abstract machine , 1997, Journal of Functional Programming.

[16]  Thomas Johnsson,et al.  Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.

[17]  Mitchell Wand,et al.  Bottom-Up beta-Substitution: Uplinks and lambda-DAGs , 2004 .

[18]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..