An operational interpretation of coinductive types

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and generalization of the notion of productivity in term rewr...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 16, Issue 1
Main Author:	Czajka, Łukasz
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2020
Subjects:	computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!