Application and formal specification of sorted term-position algebras

Authors:
Arnd Poetzsch-Heffter;Nicole Rauch
Affiliations:
University of Kaiserslautern;University of Kaiserslautern
Venue:
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Year:
2004

Citing 10
Cited 0

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Larch: languages and tools for formal specification

Larch: languages and tools for formal specification
Executing continuation semantics: a comparison

Software—Practice & Experience
Solving shape-analysis problems in languages with destructive updating

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Definition of Standard ML

The Definition of Standard ML
CASL: the common algebraic specification language

Theoretical Computer Science
A Programmer Friendly Modular Definition of the Semantics of Java

Formal Syntax and Semantics of Java
Towards Trustworthy Specifications I: Consistency Checks

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Mona & Fido: The Logic-Automaton Connection in Practice

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sorted term-position algebras are an extension of term algebras. In addition to sorted terms with constructor and selector functions, they provide term positions as algebra elements and functions that relate term positions. This paper describes possible applications of term-position algebras and investigates their formal specification in existing specification frameworks. In particular, it presents an algebraic specification of term-positions in Casl and in a higher-order logic.