Coalgebras in functional programming and type theory (Q639643): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020914843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Containers: Constructing strictly positive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A final coalgebra theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraically compact functors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setoids in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling general recursion in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation by Prophecy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of Agda – A Functional Language with Dependent Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Recursion via Coinductive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulations Generated from Corecursive Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtyping, Declaratively / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing inductively defined sets by wellorderings in Martin-Löf's type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Productivity of Stream Definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2863899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Functions on Final Coalgebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of Stream Processors Using Nested Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for proofs and programs. International Workshop TYPES '94, Båstad, Sweden, June 6-10, 1994. Selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural induction and coinduction in a fibrational setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional pearl / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in Haskell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observational Coalgebras and Complete Sets of Co-operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra and coalgebra in computer science. Third international conference, CALCO 2009, Udine, Italy, September 7--10, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixpoint theorem for complete categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The view from the left / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependently Typed Programming in Agda / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on <i>Mathematics of infinity</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive approach to nonstandard analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality of streams is a Π0 over 2-complete problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Coinduction: A Proof Theoretical Foundation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coinductive calculus of streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Origins of bisimulation and coinduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behavioural Differential Equations and Coinduction for Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence of Peano's fourth axiom from Martin-Löf's type theory without universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating Coalgebraic Notions of Bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comonadic Notions of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Definedness of Streams by Termination / rank
 
Normal rank

Latest revision as of 11:48, 4 July 2024

scientific article
Language Label Description Also known as
English
Coalgebras in functional programming and type theory
scientific article

    Statements

    Coalgebras in functional programming and type theory (English)
    0 references
    0 references
    22 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    survey article
    0 references
    corecursive methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references