A compact fixpoint semantics for term rewriting systems
type: Item
instance of: scholarly article
title: A compact fixpoint semantics for term rewriting systems
zbMATH Open document ID: 1209.68285
published in: Theoretical Computer Science
publication date: 2010-08-24T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5774338
zbMATH Keywords: term rewriting systems
zbMATH Keywords: functional programming
zbMATH Keywords: denotational semantics
zbMATH Keywords: operational semantics
zbMATH Keywords: fixpoint semantics
zbMATH Keywords: goal-independent semantics
author: María Alpuente
author: Marco Comini
author: Santiago Escobar
author: M. Falaschi
author: José Iborra
describes a project that uses: Maude
describes a project that uses: Haskell
describes a project that uses: MTT
describes a project that uses: TOY
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.012
OpenAlex ID: W2149285895
Wikidata QID: Q57978160
cites work: Abstract Diagnosis of Functional Programs
cites work: Declarative debugging of functional logic programs
cites work: Termination of narrowing revisited
cites work: The s-semantics approach: Theory and applications
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
cites work: Abstract diagnosis
cites work: Foundations of Software Science and Computation Structures
cites work: Q4385532
cites work: MTT: The Maude Termination Tool (System Description)
cites work: Declarative modeling of the operational behavior of logic languages
cites work: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
cites work: The integration of functions into logic programming: From theory to practice
cites work: Multi-paradigm Declarative Languages
cites work: Q3883561
cites work: Q4023900
cites work: Q5581665
cites work: The rewriting logic semantics project
cites work: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
cites work: Completeness results for basic narrowing
cites work: Q4414308
cites work: Q4023829
cites work: Q4799892
DOI: 10.1016/J.TCS.2010.05.012
DBLP publication ID: journals/tcs/AlpuenteCEFI10
description: scientific article; zbMATH DE number 5774338