The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Typed Lambda Calculus and Applications (TLCA) (tlca)
2009 (conf/tlca/2009)


  1. Mathematical Synthesis of Equational Deduction Systems. [Citation Graph (, )][DBLP]


  2. A Pronominal Approach to Binding and Computation. [Citation Graph (, )][DBLP]


  3. A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance. [Citation Graph (, )][DBLP]


  4. Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1. [Citation Graph (, )][DBLP]


  5. Syntax for Free: Representing Syntax with Binding Using Parametricity. [Citation Graph (, )][DBLP]


  6. On the Meaning of Logical Completeness. [Citation Graph (, )][DBLP]


  7. Thick Subtrees, Games and Experiments. [Citation Graph (, )][DBLP]


  8. Bounded Linear Logic, Revisited. [Citation Graph (, )][DBLP]


  9. Partial Orders, Event Structures and Linear Strategies. [Citation Graph (, )][DBLP]


  10. Existential Type Systems with No Types in Terms. [Citation Graph (, )][DBLP]


  11. Initial Algebra Semantics for Cyclic Sharing Structures. [Citation Graph (, )][DBLP]


  12. An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form. [Citation Graph (, )][DBLP]


  13. Refinement Types as Proof Irrelevance. [Citation Graph (, )][DBLP]


  14. Weak omega-Categories from Intensional Type Theory. [Citation Graph (, )][DBLP]


  15. Relating Classical Realizability and Negative Translation for Existential Witness Extraction. [Citation Graph (, )][DBLP]


  16. Session-Based Communication Optimisation for Higher-Order Mobile Processes. [Citation Graph (, )][DBLP]


  17. The Cut-Elimination Theorem for Differential Nets with Promotion. [Citation Graph (, )][DBLP]


  18. A Polymorphic Type System for the Lambda-Calculus with Constructors. [Citation Graph (, )][DBLP]


  19. Kripke Semantics for Martin-Löf's Extensional Type Theory. [Citation Graph (, )][DBLP]


  20. On the Values of Reducibility Candidates. [Citation Graph (, )][DBLP]


  21. Lexicographic Path Induction. [Citation Graph (, )][DBLP]


  22. Parametricity for Haskell with Imprecise Error Semantics. [Citation Graph (, )][DBLP]


  23. Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic. [Citation Graph (, )][DBLP]


  24. Algebraic Totality, towards Completeness. [Citation Graph (, )][DBLP]


  25. A Logical Foundation for Environment Classifiers. [Citation Graph (, )][DBLP]


  26. Inhabitation of Low-Rank Intersection Types. [Citation Graph (, )][DBLP]


  27. Differential Linear Logic and Polarization. [Citation Graph (, )][DBLP]


  28. Complexity of Gödel's T in lambda-Formulation. [Citation Graph (, )][DBLP]


  29. The Computational SLR: A Logic for Reasoning about Computational Indistinguishability. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002