FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
The π-calculus in direct style
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A non-deterministic call-by-need lambda calculus
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Distributed processes and location failures
Theoretical Computer Science
Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
The π-Calculus in Direct Style
Higher-Order and Symbolic Computation
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
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
A filter model for mobile processes
Mathematical Structures in Computer Science
On the representation of McCarthy's amb in the π-calculus
Theoretical Computer Science - Expressiveness in concurrency
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Term Collections in λ and ρ-calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A Relational Model of a Parallel and Non-deterministic λ -Calculus
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Filter Model for Safe Ambients
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizing convergent terms in object calculi via intersection types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
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
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.00 |