Reduction relations in strict applicative languages

Reduction relations in strict applicative languages

We investigate the reduction relations for a strongly typed higher-order applicative language employing function application, conditional, function abstraction and recursion. In particular, we propose a new approach how to correctly implement a strict (“call-by-value”) semantics in the setting of te...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Dosch, Walter
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Expression Language
Normal Form
Operational Semantic
Reduction Relation
Reduction Rule
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the reduction relations for a strongly typed higher-order applicative language employing function application, conditional, function abstraction and recursion. In particular, we propose a new approach how to correctly implement a strict (“call-by-value”) semantics in the setting of term rewriting. We study the confluence and termination properties of the reduction system obtained.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0035166