Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
Theoretical Computer Science - Special issue on theories of types and proofs
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
A Co-inductive Approach to Real Numbers
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Specification and Verification of a Formal System for Structurally Recursive Functions
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Mathematical Structures in Computer Science
Type-based termination of recursive definitions
Mathematical Structures in Computer Science
Journal of Functional Programming
A predicative analysis of structural recursion
Journal of Functional Programming
Confluence of the coinductive λ-calculus
Theoretical Computer Science
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Interfaces as functors, programs as coalgebras: a final coalgebra theorem in intensional type theory
Theoretical Computer Science
Affine functions and series with co-inductive real numbers
Mathematical Structures in Computer Science
A certified type-preserving compiler from lambda calculus to assembly language
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I
Electronic Notes in Theoretical Computer Science (ENTCS)
A coinductive monad for prop-bounded recursion
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Coinductive big-step operational semantics
Information and Computation
Modular development of certified program verifiers with a proof assistant1,2
Journal of Functional Programming
Trace-Based Coinductive Operational Semantics for While
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Formal Verification of Exact Computations Using Newton's Method
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Productivity of stream definitions
Theoretical Computer Science
Recursive Coalgebras from Comonads
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Termination and productivity checking with continuous types
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A unifying approach to recursive and co-recursive definitions
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A PVS proof obligation generator for Lustre programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Certified exact real arithmetic using co-induction in arbitrary integer base
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Let's see how things unfold: reconciling the infinite with the intensional
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Bisimulations Generated from Corecursive Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Adjoint folds and unfolds: or: scything through the thicket of morphisms
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Proving the unique fixed-point principle correct: an adventure with category theory
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A few constructions on constructors
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Filters on coinductive streams, an application to eratosthenes' sieve
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Privacy in data mining using formal methods
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Epigram: practical programming with dependent types
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Coinductive big-step operational semantics
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Generic programming with adjunctions
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Shall we juggle, coinductively?
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
The power of parameterization in coinductive proof
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Productive coprogramming with guarded recursion
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Adjoint folds and unfolds-An extended study
Science of Computer Programming
Circular coinduction in coq using bisimulation-up-to techniques
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Hi-index | 0.00 |