Programming in equational logic: Beyond strong sequentiality
From MaRDI portal
Publication:689097
DOI10.1006/INCO.1993.1026zbMATH Open0803.68060OpenAlexW2102574149MaRDI QIDQ689097FDOQ689097
Publication date: 2 January 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2412818376b72210aaa6f1800d5c40a11882301c
Recommendations
- Algebra and Coalgebra in Computer Science
- Specifying, programming and verifying with equational logic
- An equational approach to logic programming
- Foundations of equational logic programming
- scientific article; zbMATH DE number 4037157
- scientific article; zbMATH DE number 3958699
- scientific article
- Equivalences among logics of programs
- scientific article
- Deductive and inductive synthesis of equational programs
General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Cited In (22)
- On abstract normalisation beyond neededness
- Minimal relative normalization in orthogonal expression reduction systems
- A refinement of strong sequentiality for term rewriting with constructors
- The development of a partial evaluator for extended lambda calculus
- Classes of equational programs that compile into efficient machine code
- Title not available (Why is that?)
- Reduction strategies for declarative programming
- Narrowing and rewriting logic: from foundations to applications
- Evaluation strategies for functional logic programming
- Computations in APS
- Sequentiality, monadic second-order logic and tree automata.
- Equational programming in \(\lambda\)-calculus via SL-systems. Part 1
- Complete symbolic reachability analysis using back-and-forth narrowing
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- A rationale for conditional equational programming
- On interreduction of semi-complete term rewriting systems
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Evaluation strategies for functional logic programming
- Functional Logic Programming: From Theory to Curry
- Context-sensitive rewriting strategies
- A sequential reduction strategy
- Transformations and confluence for rewrite systems
This page was built for publication: Programming in equational logic: Beyond strong sequentiality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689097)
