A recursion theorem for predicate transformers on inductive data types

David A. Naumann

doi:10.1016/0020-0190(94)00049-2

A recursion theorem for predicate transformers on inductive data types

David A. Naumann

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Original language	English
Pages (from-to)	329-336
Number of pages	8
Journal	Information Processing Letters
Volume	50
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(94)00049-2
State	Published - 27 Jun 1994

Keywords

Catamorphism
Higher types
Inductive data type
Lax exponent
Predicate transformer
Programming calculi, Refinement calculus

Access to Document

10.1016/0020-0190(94)00049-2

Cite this

@article{67cff11289ad40828f7dd972719d9681,

title = "A recursion theorem for predicate transformers on inductive data types",

keywords = "Catamorphism, Higher types, Inductive data type, Lax exponent, Predicate transformer, Programming calculi, Refinement calculus",

author = "Naumann, \{David A.\}",

year = "1994",

month = jun,

day = "27",

doi = "10.1016/0020-0190(94)00049-2",

language = "English",

volume = "50",

pages = "329--336",

number = "6",

}

TY - JOUR

T1 - A recursion theorem for predicate transformers on inductive data types

AU - Naumann, David A.

PY - 1994/6/27

Y1 - 1994/6/27

KW - Catamorphism

KW - Higher types

KW - Inductive data type

KW - Lax exponent

KW - Predicate transformer

KW - Programming calculi, Refinement calculus

UR - https://www.scopus.com/pages/publications/0028447052

UR - https://www.scopus.com/inward/citedby.url?scp=0028447052&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(94)00049-2

DO - 10.1016/0020-0190(94)00049-2

M3 - Article

AN - SCOPUS:0028447052

SN - 0020-0190

VL - 50

SP - 329

EP - 336

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

A recursion theorem for predicate transformers on inductive data types

Keywords

Access to Document

Other files and links

Cite this