Relating models of polymorphism
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Elements of interaction: Turing award lecture
Communications of the ACM
QPC2: A constructive calculus with parameterized specifications
Journal of Symbolic Computation - Special issue on automatic programming
Encoding types in ML-like languages
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
Quantitative Semantics Revisited
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Game Semantics for Untyped lambda beta eta-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Disjoint Sums over Type Classes in HOL
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Order-Incompleteness and Finite Lambda Models, Extended Abstract
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Order-incompleteness and finite Lambda reduction models
Theoretical Computer Science
βη-complete models for System F
Mathematical Structures in Computer Science
Universal homogeneous graph-like structures and domains
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
A general method for proving the normalization theorem for first and second order typed λ-calculi
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
Encoding types in ML-like languages
Theoretical Computer Science - Mathematical foundations of programming semantics
Mathematical Structures in Computer Science
Staged computation with names and necessity
Journal of Functional Programming
Information and Computation
Intersection-types à la Church
Information and Computation
ACM Turing award lectures
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Computation with classical sequents
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Information systems revisited – the general continuous case
Theoretical Computer Science
Maximality and totality of stable functions in the category of stable bifinite domains
Computers & Mathematics with Applications
Algebraic Totality, towards Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Theoretical Computer Science
The Polymorphic Rewriting-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A new model construction for the polymorphic lambda calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Curry-style types for nominal terms
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Principal types for nominal theories
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
Internal models of system F for decompilation
Theoretical Computer Science
RANK 2 INTERSECTION TYPE ASSIGNMENT IN TERM REWRITING SYSTEMS
Fundamenta Informaticae
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Intersection Types from a Proof-theoretic Perspective
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 5.25 |