Programming in equational logic: Beyond strong sequentiality

DOI10.1006/INCO.1993.1026MaRDI QIDQ689097zbMATH OpenOpenAlexFDO

Authors I. V. Ramakrishnan, R. Sekar

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

zbMATH Keywords

term rewriting systemsstrong sequentialitynecessary redexes

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

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; zbMATH DE number 177798
• Equivalences among logics of programs
• scientific article; zbMATH DE number 3846863
• Deductive and inductive synthesis of equational programs

Cited in

(22)

• Narrowing and rewriting logic: from foundations to applications
• Complete symbolic reachability analysis using back-and-forth narrowing
• The development of a partial evaluator for extended lambda calculus
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• On interreduction of semi-complete term rewriting systems
• A refinement of strong sequentiality for term rewriting with constructors
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
• Evaluation strategies for functional logic programming
• Transformations and confluence for rewrite systems
• On abstract normalisation beyond neededness
• A rationale for conditional equational programming
• Classes of equational programs that compile into efficient machine code
• A sequential reduction strategy
• Sequentiality, monadic second-order logic and tree automata.
• Functional Logic Programming: From Theory to Curry
• Reduction strategies for declarative programming
• Computations in APS
• Equational programming in \(\lambda\)-calculus via SL-systems. Part 1
• scientific article; zbMATH DE number 4094872 (Why is no real title available?)
• Minimal relative normalization in orthogonal expression reduction systems
• Evaluation strategies for functional logic programming
• Context-sensitive rewriting strategies

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)