Journal of Symbolic Computation
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
A syntactic approach to eta equality in type theory
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic Completion of Nondeterministic Models
Electronic Notes in Theoretical Computer Science (ENTCS)
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Aspect oriented programming: a language for 2-categories
Proceedings of the 10th international workshop on Foundations of aspect-oriented languages
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
A monadic interpretation of execution levels and exceptions for AOP
Proceedings of the 11th annual international conference on Aspect-oriented Software Development
Spatial and temporal aspects in visual interaction
Journal of Visual Languages and Computing
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |