Transfinite corecursion

Authors:
Härmel Nestra
Affiliations:
Institute of Computer Science, University of Tartu, Tartu, Estonia
Venue:
Nordic Journal of Computing
Year:
2005

Citing 6
Cited 1

The Z notation: a reference manual

The Z notation: a reference manual
Notes on set theory

Notes on set theory
Transfinite reductions in orthogonal term rewriting systems

Information and Computation
The Semantics of Program Slicing and Program Integration

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Program Specialization via Program Slicing

Selected Papers from the Internaltional Seminar on Partial Evaluation
Non-Standard Semantics for Program Slicing

Higher-Order and Symbolic Computation

Fractional semantics

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents theorems which enable to define transfinite semantics for programming languages easily. We call these theorems "corecursion theorems" because they state the existence of a function satisfying certain conditions analogous to the usual corecurrent equations for defining stream-valued functions.Transfinite semantics have been proposed for overcoming the "semantic anomaly" of program slicing. In this paper, we define two example semantics which justify this approach, relying on our corecursion theorems.