Rewriting and narrowing for constructor systems with call-time choice semantics
DOI10.1017/S1471068412000373zbMath1286.68265arXiv1209.2617OpenAlexW2964182171MaRDI QIDQ5410729
Jaime Sánchez-Hernández, Francisco J. López Fraguas, Enrique Martin-Martin, Juan Rodríguez-Hortalá
Publication date: 17 April 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.2617
term rewriting systemsnarrowingnon-determinismsharingcall-time choice semanticsconstructor-based rewriting logiclocal bindings
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Related Items (2)
Cites Work
- Programming languages and systems. 8th Asian symposium, APLAS 2010, Shanghai, China, November 28--December 1, 2010. Proceedings
- Special issue: PEPM 2010, ACM SIGPLAN 2010 workshop on partial evaluation and program manipulation, Madrid, Spain, January 18--19, 2010. Selected papers.
- Properties of a first-order functional language with sharing
- Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15--17, 2008. Proceedings
- Rewriting techniques and applications. 20th international conference, RTA 2009, Brasília, Brazil, June 29--July 1, 2009. Proceedings
- Computer programming and formal systems
- Frontiers of combining systems. 3rd international workshop, FroCoS 2000, Nancy, France, March 22--24, 2000. Proceedings
- Functional and constraint logic programming. 18th international workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009. Revised selected papers
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- Functional and logic programming. 9th international symposium, FLOPS 2008, Ise, Japan, April 14--16, 2008. Proceedings
- Programming languages and systems. 5th Asian symposium, APLAS 2007, Singapore, November 29--December 1, 2007. Proceedings
- Extra Variables Can Be Eliminated from Functional Logic Programs
- Equivalence of Two Formal Semantics for Functional Logic Programs
- A needed narrowing strategy
- The call-by-need lambda calculus
- The call-by-need lambda calculus
- Uniform Lazy Narrowing
- An approach to declarative programming based on a rewriting logic
This page was built for publication: Rewriting and narrowing for constructor systems with call-time choice semantics
