Decidable Call-By-Need Computations in Term Rewriting

Information and Computation - United States
doi 10.1016/j.ic.2004.10.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Call-By-Need Is Clairvoyant Call-By-Value

Proceedings of the ACM on Programming Languages
2019English

Foundations of Strong Call by Need

Proceedings of the ACM on Programming Languages
2017English

Critical Pairs in Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

A Non-Deterministic Call-By-Need Lambda Calculus

ACM SIGPLAN Notices
1999English

Transfinite Reductions in Orthogonal Term Rewriting Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Confluence of Curried Term-Rewriting Systems

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

Context Term Calculus for Rewriting Systems

PROBLEMS IN PROGRAMMING
2018English

Simplification Orders for Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Hardware Synthesis From Term Rewriting Systems

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy