Logic Programming and Automated Reasoning
DOI: 10.1007/bfb0013095
|View full text |Cite
|
Sign up to set email alerts
|

ProPre A programming language with proofs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…Inductive or coinductive types, such as lists or streams, can then be seen as sized types annotated by a large enough (limit) ordinal. 21 In practice, the implementation of PML 2 introduces sizes automatically when typing recursive functions. This means that it replaces (some) inductive and coinductive types, which carry a limit ordinal, with universal quantification over all possible ordinals.…”
Section: Sized Typesmentioning
confidence: 99%
See 1 more Smart Citation
“…Inductive or coinductive types, such as lists or streams, can then be seen as sized types annotated by a large enough (limit) ordinal. 21 In practice, the implementation of PML 2 introduces sizes automatically when typing recursive functions. This means that it replaces (some) inductive and coinductive types, which carry a limit ordinal, with universal quantification over all possible ordinals.…”
Section: Sized Typesmentioning
confidence: 99%
“…Several systems have been proposed for verifying ML programs. ProPre [21] relies on a notion of algorithms, corresponding to equational specifications of programs. It is used in conjunction with a type system based on intuitionistic logic.…”
Section: Systems Aimed At Program Verification In MLmentioning
confidence: 99%