Journal of Symbolic Computation
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Coinductive Interpreters for Process Calculi
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Calculating Functional Programs
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Calculating functional programs
Algebraic and coalgebraic methods in the mathematics of program construction
Hidden coinduction: behavioural correctness proofs for objects
Mathematical Structures in Computer Science
Journal of Functional Programming
Recursive coalgebras from comonads
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Iteration and coiteration schemes for higher-order and nested datatypes
Theoretical Computer Science - Foundations of software science and computation structures
Metamorphisms: Streaming representation-changers
Science of Computer Programming
Configurations of Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
An Exercise on Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A perspective on service orchestration
Science of Computer Programming
Some Remarks on Type Systems for Course-of-value Recursion
Electronic Notes in Theoretical Computer Science (ENTCS)
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Realizability for Monotone and Clausular (Co)inductive Definitions
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
(Co-) iteration for higher-order nested datatypes
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
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
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science (ENTCS)
A foundation for GADTs and inductive families: dependent polynomial functor approach
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
Supporting Agent Systems in the Programming Language
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Privacy in data mining using formal methods
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Generic programming with adjunctions
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Parameters And Parametrization In Specification, Using Distributive Categories
Fundamenta Informaticae
Software components as invariant-typed arrows
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Coalgebraic Aspects of Context-Awareness
Mobile Networks and Applications
Adjoint folds and unfolds-An extended study
Science of Computer Programming
Hi-index | 0.00 |