On constructor rewrite systems and the lambda-calculus (original) (raw)
Related papers
Decidable call-by-need computations in term rewriting
Information and Computation, 2005
An invariant cost model for the lambda calculus
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
The weak lambda calculus as a reasonable machine
Theoretical Computer Science, 2008
Derivational Complexity and Context-Sensitive Rewriting
Journal of Automated Reasoning, 2021
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
2016
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
Automata, Languages and Programming, 1994
Decidable call by need computations in term rewriting (extended abstract)
Lecture Notes in Computer Science, 1997
Normalization Results for Typeable Rewrite Systems
Information and Computation, 1997
Normalization by Evaluation for Typed Weak lambda-Reduction
2018
Graph reducibility of term rewriting systems
Lecture Notes in Computer Science, 1995
Enhancing dependency pair method using strong computability in simply-typed term rewriting
Applicable Algebra in Engineering, Communication and Computing, 2007
Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes
IPSJ Online Transactions, 2009
Transfinite Rewriting Semantics for Term Rewriting Systems
Rewriting Techniques and Applications, 2001
Some reduction strategies for algebraic term rewriting
SIGSAM bulletin, 1982
Natural Rewriting for General Term Rewriting Systems
2004
Transformations and reduction strategies for typed lambda expressions
ACM Transactions on Programming Languages and Systems, 1984
Specification of reduction strategies in term rewriting systems
Lecture Notes in Computer Science, 1987
An Efficient Interpreter for the Lambda-Calculus
Journal of Computer and System Sciences, 1981
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
IEICE Transactions on Information and Systems, 2009
A self-interpreter of lambda calculus having a normal form
Lecture Notes in Computer Science, 1993
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
IEICE Transactions on Information and Systems, 2009
Separability and translatability of sequential term rewrite systems into the lambda calculus
2001
Constant runtime complexity of term rewriting is semi-decidable
Information Processing Letters, 2018
Head-order techniques and other pragmatics of lambda calculus graph reduction
1993
Explicit substitutions in the reduction of lambda terms
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03, 2003
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule
Proceedings of FSCD'16, 2016
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Ω-Rule
2016
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science, 2009
The cost of usage in the λ-calculus
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract)
1991
Refocusing in reduction semantics
2004
Reducing Lambda Terms with Traversals ( preprint ) February 28 , 2018
2018
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Electronic Notes in Theoretical Computer Science, 2005
Efficient self-interpretation in lambda calculus
Journal of Functional Programming, 1992
Semantics of non-terminating rewrite systems using minimal coverings
1995