A characterization of F-complete assignments
Theoretical Computer Science
Type theories, normal forms, and D∞-lambda-models
Information and Computation
A unification semi-algorithm for intersection type schemes
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Principal type scheme and unification for intersection type discipline
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
SIAM Journal on Computing
Type inference with recursive types: syntax and semantics
Information and Computation
Intersection types for combinatory logic
Theoretical Computer Science
Operational, denotational and logical descriptions: a case study
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Type inference, abstract interpretation and strictness analysis
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Journal of Computer and System Sciences
Type inference: some results, some problems
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A type inference algorithm for a stratified polymorphic type discipline
Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Intersection and union types: syntax and semantics
Information and Computation
Principal types and unification for simple intersection type systems
Information and Computation
Filter models for conjunctive-disjunctive &lgr;-calculi
Theoretical Computer Science
A convex powerdomain over lattices: its logic and &lgr;-calculus
Fundamenta Informaticae
A Filter Model for Concurrent $\lambda$-Calculus
SIAM Journal on Computing
Infinite &lgr;-calculus and types
Theoretical Computer Science - Special issue: Gentzen
Alpha-conversion and typability
Information and Computation
Discrimination by parallel observers: the algorithm
Information and Computation
Operational semantics and extensionality
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Intersection types for λ-trees
Theoretical Computer Science - Special issue on theories of types and proofs
Strictness, totality, and non-standard-type inference
Theoretical Computer Science - Special issue on theories of types and proofs
More dynamic object reclassification: Fickle∥
ACM Transactions on Programming Languages and Systems (TOPLAS)
A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
An Extended Polymorphic Type System for Applicative Languages
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Filter Models for a Parallel and Non Deterministic Lambda-Calculus
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
May and Must Convergencey in Concurrent Lambda-Calculus
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Fully Abstract Semantics for Concurrent Lambda-calculus
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Type Inference in Polymorphic Type Discipline
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Categorical semantics of the call-by-value lambda-calculus
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Fickle: Dynamic Object Re-classification
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Combinatorial Problems, Combinator Equations and Normal Forms
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Termination Tests inside lambda-Calculus
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Functional Characterization of Some Semantic Equalities inside Lambda-Calculus
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
A Completeness Theorem for Recursively Defined Types
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Incremental Inference of Partial Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Characterising Strong Normalisation for Explicit Substitutions
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
Subtyping Constraints for Incomplete Objects (Extended Abstract)
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Lambda-terms as total or partial functions on normal forms
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Refinement Types for Program Analysis
SAS '96 Proceedings of the Third International Symposium on Static Analysis
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Listing of information structures defined by fixed-point operators
Programming Symposium, Proceedings Colloque sur la Programmation
Discriminability of Infinite Sets of Terms in the Dinfinity-Models of the lambda-calculus
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Completeness Results for a Polymorphic Type System
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Applicative Information Systems
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
A Complete Type Inference Algorithm for Simple Intersection Types
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Infinitary lambda calculus and discrimination of Berarducci trees
Theoretical Computer Science - Australasian computer science
Discrimination by Parallel Observers
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The call-by-value λ-calculus: a semantic investigation
Mathematical Structures in Computer Science
A filter model for mobile processes
Mathematical Structures in Computer Science
Re-classification and multi-threading: FickleMT
Proceedings of the 2004 ACM symposium on Applied computing
Structured Operational Semantics of a fragment of the language Scheme
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Parametric parameter passing λ-calculus
Information and Computation
Intersection types and domain operators
Theoretical Computer Science - Logic, semantics and theory of programming
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
BASS: boxed ambients with safe sessions
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
Normalisation is Insensible to \lambda-Term Identity or Difference
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Principal Typing for Lambda Calculus in Elementary Affine Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Behavioural Model for Klop's Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Space-aware ambients and processes
Theoretical Computer Science
Intersection-types à la Church
Information and Computation
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types for ambient and process mobility†
Mathematical Structures in Computer Science
Security types for dynamic web data
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Type Preorders and Recursive Terms
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards an Intersection Typed System à la Church
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Asynchronous session types and progress for object oriented languages
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Security types for dynamic web data
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Bounded session types for object oriented languages
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
On progress for structured communications
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
A distributed object-oriented language with session types
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
An operational characterization of strong normalization
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Elementary affine logic and the call-by-value lambda calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Encoding CDuce in the Cπ-calculus
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
A Subtyping for Extensible, Incomplete Objects
Fundamenta Informaticae
A soft type assignment system for &lambda-calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 5.23 |