This paper presents a functional programming language, based on Moggi's monadic metalanguage. In the ΓΏrst part of this paper, we show how the language can be regarded as a monad on a category of signatures, and that the resulting category of algebras is equivalent to the category of computationally
β¦ LIBER β¦
A Categorical Semantics of Higher Order Store
β Scribed by J. Laird
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 248 KB
- Volume
- 69
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A fully abstract semantics for a higher-
β
Alan Jeffrey
π
Article
π
1999
π
Elsevier Science
π
English
β 299 KB
Lack of Phonological Mediation in a Sema
β
Marcus Taft; Fiona van Graan
π
Article
π
1998
π
Elsevier Science
π
English
β 189 KB
Adapting Big-Step Semantics to Small-Ste
β
Husain Ibraheem; David A. Schmidt
π
Article
π
1998
π
Elsevier Science
π
English
β 36 KB
A uniform semantic proof for cut-elimina
β
Mitsuhiro Okada
π
Article
π
2002
π
Elsevier Science
π
English
β 201 KB
Phase semantic cut-elimination and norma
β
Mitsuhiro Okada
π
Article
π
1999
π
Elsevier Science
π
English
β 698 KB
A Higher-order Interpretation of Deducti
β
Abdelwaheb Ayari; David Basin
π
Article
π
2001
π
Elsevier Science
π
English
β 325 KB
The Deductive Tableau of Manna and Waldinger is a formal system with an associated methodology for synthesizing functional programs by existence proofs in classical first-order theories. We reinterpret the formal system in a setting that is higher-order in two respects: higher-order logic is used to