Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The π-calculus in direct style
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improvement in a lazy context: an operational theory for call-by-need
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stack inspection: theory and variants
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
From rewrite rules to bisimulation congruences
Theoretical Computer Science
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
The π-Calculus in Direct Style
Higher-Order and Symbolic Computation
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Higher-Order and Symbolic Computation
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional Characterizations of lambda-Terms Using Intersection Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Game Semantics for Untyped lambda beta eta-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Games Characterizing Levy-Longo Trees
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Fully Abstract Model for Higher-Order Mobile Ambients
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Topological incompleteness and order incompleteness of the lambda calculus
ACM Transactions on Computational Logic (TOCL)
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Demonstrating lambda calculus reduction
The essence of computation
Adapting innocent game models for the Böhm tree λ-theory
Theoretical Computer Science
Introduction to Special Issue: Intersection types-new insights
Mathematical Structures in Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Relating operational and denotational semantics for input/output effects
Mathematical Structures in Computer Science
A filter model for mobile processes
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Parametric parameter passing λ-calculus
Information and Computation
Games characterizing Levy-Longo trees
Theoretical Computer Science - Special issue on automata, languages and programming
Extending Answer Sets for Logic Programming Agents
Annals of Mathematics and Artificial Intelligence
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Bisimilarity for the Region Calculus
Higher-Order and Symbolic Computation
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
Proceedings of the 6th international conference on Aspect-oriented software development
A logical approach to stable domains
Theoretical Computer Science
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Coalgebraic description of generalised binary methods
Mathematical Structures in Computer Science
Theoretical Computer Science
Theoretical Computer Science
Applications of infinitary lambda calculus
Information and Computation
Transactions on Aspect-Oriented Software Development V
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
A Filter Model for Safe Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Small-step and big-step semantics for call-by-need
Journal of Functional Programming
Game semantics for the pure lazy λ-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Characterizing convergent terms in object calculi via intersection types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
RPO, second-order contexts, and λ-calculus
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Strong normalization from an unusual point of view
Theoretical Computer Science
Relating function spaces to resourced function spaces
Proceedings of the 2011 ACM Symposium on Applied Computing
Journal of Automated Reasoning
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Normal form bisimulations for delimited-control operators
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Pure type systems with corecursion on streams: from finite to infinitary normalisation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Convex Powerdomain over Lattices: its Logic and λ-Calculus
Fundamenta Informaticae
Highlights in infinitary rewriting and lambda calculus
Theoretical Computer Science
On coinductive equivalences for higher-order probabilistic functional programs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.02 |