A complete characterization of complete intersection-type preorders
ACM Transactions on Computational Logic (TOCL)
Uncountable limits and the lambda calculus
Nordic Journal of Computing
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
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Fine Structure of Game Lambda Models
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Topological incompleteness and order incompleteness of the lambda calculus
ACM Transactions on Computational Logic (TOCL)
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
Introduction to Special Issue: Intersection types-new insights
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Coinductive characterizations of applicative structures
Mathematical Structures in Computer Science
Intersection types and domain operators
Theoretical Computer Science - Logic, semantics and theory of programming
Graph models of $\lambda$-calculus at work, and variations
Mathematical Structures in Computer Science
Theoretical Computer Science - Algebraic methods in language processing
Intersection types and lambda models
Theoretical Computer Science - Logic, language, information and computation
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
On the completeness of order-theoretic models of the λ-calculus
Information and Computation
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Type Preorders and Recursive Terms
Electronic Notes in Theoretical Computer Science (ENTCS)
Recursive domain equations of filter models
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Lambda theories of effective lambda models
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 0.00 |