Notions of Computation and Monads
Explore this paper's citation graph
Summary
Calculi are introduced, based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation.
- Type
- article
- Published
- 1991-07-01
- Cited by
- 2,034
- References
- 39
- Access
- Open access
- OpenAlex
- https://openalex.org/W1997143185
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:12767331
Keywords
Equivalence (formal languages), Computation, Categorical variable, Computer science, Semantics (computer science)
References
- Reasoning with Continuations
- First order categorical logic
- Toposes, Triples and Theories
- Partial Objects In Constructive Type Theory
- The partial lambda calculus
- Verification of Programs That Destructively Manipulate Data
- A Syntactic Theory of Sequential State
- Strong functors and monoidal monads
- Introduction to higher order categorical logic
- Call-by-Name, Call-by-Value and the lambda-Calculus
- Computational foundations of basic recursive function theory
- Denotational Semantics: A Methodology for Language Development
- The category-theoretic solution of recursive domain equations
- Categories for the Working Mathematician
- Higher-order modules and the phase distinction
- A sound and complete axiomatization of operational equivalence of programs with memory
- New foundations for fixpoint computations
- Computational lambda-calculus and monads
- A category-theoretic account of program modules
- The Linear Abstract Machine
Cited by
- States and exceptions are dual effects
- Inductive representation, proofs and refinement of pointer structures
- Staging Dynamic Programming Algorithms
- Functional programming with names and necessity
- Actions, Ramifications and Linear Modalities
- A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems
- Toward the Automation of Category Theory
- Call-by-push-value
- The formal relationship between direct and continuation-passing style optimizing compilers - a synthesis of two paradigms
- Combining continuations with other effects
- Completeness of monad-based dynamic logic
- Separation Logic for a Higher-Order Typed Language
- Algebraic Enriched Coalgebras
- Composing Specifications Using Algebra Combinators
- Structuring general and complete quantum computations in Haskell : the arrows approach
- Formal Aspects of Polyvariant Specialization
- Cyrptographic logical relations 1
- The structure of continuation-passing styles
- Relational Reasoning about Functions and Nondeterminism
- Well Constructed Workflows in Bioinformatics
Related papers
- Modular language implementation in Rascal - experience report
- On objects and events
- JastAdd--an aspect-oriented compiler construction system
- Prolog - the language and its implementation compared with Lisp
- Factor
- Total and Partial Computation in Categorical Quantum Foundations
- The Decomposition of ESM Computations