POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Duality between Call-by-Name Recursion and Call-by-Value Iteration
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A General Notion of Realizability
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Fast and loose reasoning is morally correct
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Domain-theoretical models of parametric polymorphism
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Hiord: a type-free higher-order logic programming language with predicate abstraction
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
A Simple Adequate Categorical Model for PCF, II
Fundamenta Informaticae
| Hi-index | 5.23 |