scientific article; zbMATH DE number 4016167

MaRDI QIDQ3028319zbMATH OpenFDO

Authors Bharat Jayaraman, David A. Plaisted

Publication date 1987

zbMATH Keywords

confluent rewriting systemcorrectnessdeclarative semanticsDeterministic reductionequationsNondeterministic reductionoperational semanticsSELSet abstractionSet-Equation Language

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
• scientific article; zbMATH DE number 3976287
• Set abstraction - an extension of all solutions predicate in logic programming language
• scientific article; zbMATH DE number 1487843
• {log}: A language for programming in logic with finite sets

Cited in

(11)

• Conditional rewriting logic as a unified model of concurrency
• On minimality of one set of built-in functions for functional programming languages
• scientific article; zbMATH DE number 3942990 (Why is no real title available?)
• scientific article; zbMATH DE number 3976287 (Why is no real title available?)
• scientific article; zbMATH DE number 3982488 (Why is no real title available?)
• scientific article; zbMATH DE number 176725 (Why is no real title available?)
• scientific article; zbMATH DE number 1479608 (Why is no real title available?)
• Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
• Partial order programming (revisited)
• Conditional rewriting logic: Deduction, models and concurrency
• Subset-equational programming in intelligent decision systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028319)