Partiality and Container Monads

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Asian Symposium on Programming Languages and Systems

• Publication date

  2017-11-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-71237-6_20
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Stack semantics of type theory

  2017cited by this paper
• Container Combinatorics: Monads and Lax Monoidal Functors

  2017cited by this paper
• The Delay Monad and Restriction Categories

  2017cited by this paper
• Partial Elements and Recursion via Dominances in Univalent Type Theory

  2017influential reference
• Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type

  2016cited by this paper
• Quotienting the delay monad by weak bisimilarity

  2015cited by this paper
• Homotopy Type Theory: Univalent Foundations of Mathematics

  2013cited by this paper
• When is a container a comonad?

  2012cited by this paper
• Under consideration for publication in Math. Struct. in Comp. Science Partiality and Recursion in Interactive Theorem Provers — An Overview

  2011cited by this paper
• Dependently typed programming in Agda

  2009influential reference
• General recursion via coinductive types

  2005cited by this paper
• Containers: Constructing strictly positive types

  2005cited by this paper
• Synthetic Topology: of Data Types and Classical Spaces

  2004cited by this paper
• Restriction categories II: partial map classification

  2003cited by this paper
• An equational notion of lifting monad

  2003cited by this paper
• Restriction categories III: colimits, partial limits and extensivity

  2002cited by this paper
• Notions of Computation and Monads

  1991cited by this paper
• Categories of Partial Maps

  1988influential reference

• Uniform Elgot Iteration in Foundations

  2021cites this paper
• Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning

  2020cites this paper
• En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad

  2019cites this paper
• Double Applicative Functors

  2018cites this paper
• Partial functions and recursion in univalent type theory

  2018cites this paper