2002
DOI: 10.1007/3-540-45607-4_13
|View full text |Cite
|
Sign up to set email alerts
|

Extracting General Recursive Program Schemes in Nuprl’s Type Theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…• One of them is to follow the correct by construction slogan and to produce code from the specification, either by means of a transformational approach that often requires human intervention, or by casting the original problem in some constructive type theory that will lead directly to an implementation in a calculus by exploiting the Curry-Howard isomorphism [105,22,13,102].…”
Section: Executable Prototypes and Logic Programmingmentioning
confidence: 99%
“…• One of them is to follow the correct by construction slogan and to produce code from the specification, either by means of a transformational approach that often requires human intervention, or by casting the original problem in some constructive type theory that will lead directly to an implementation in a calculus by exploiting the Curry-Howard isomorphism [105,22,13,102].…”
Section: Executable Prototypes and Logic Programmingmentioning
confidence: 99%