Programming in equational logic: Beyond strong sequentiality

DOI10.1006/inco.1993.1026zbMath0803.68060OpenAlexW2102574149MaRDI QIDQ689097

I. V. Ramakrishnan, R. Chandra Guru 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

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

Related Items (15)

Complete symbolic reachability analysis using back-and-forth narrowing ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ Evaluation strategies for functional logic programming ⋮ A sequential reduction strategy ⋮ Transformations and confluence for rewrite systems ⋮ On abstract normalisation beyond neededness ⋮ Functional Logic Programming: From Theory to Curry ⋮ On interreduction of semi-complete term rewriting systems ⋮ The development of a partial evaluator for extended lambda calculus ⋮ Evaluation Strategies for Functional Logic Programming ⋮ Reduction Strategies for Declarative Programming ⋮ Sequentiality, monadic second-order logic and tree automata. ⋮ Context-sensitive rewriting strategies ⋮ Computations in APS ⋮ Narrowing and Rewriting Logic: from Foundations to Applications

This page was built for publication: Programming in equational logic: Beyond strong sequentiality