Completeness of intersection and union type assignment systems for call-by-value λ-models
Theoretical Computer Science - Special issue on theories of types and proofs
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Compositional Characterizations of lambda-Terms Using Intersection Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Introduction to Special Issue: Intersection types-new insights
Mathematical Structures in Computer Science
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
Parametric parameter passing λ-calculus
Information and Computation
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Calculi, types and applications
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
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
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
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
| Hi-index | 0.00 |