Conferences in DBLP
Andrea Asperti , Cosimo Laneve Comparing Lambda-calculus translations in Sharing Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe Extensions of Pure Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bellucci , Martín Abadi , Pierre-Louis Curien A Model for Formal Parametric Polymorphism: A PER Interpretation for System R. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Berardi , Marc Bezem , Thierry Coquand A realization of the negative interpretation of the Axiom of Choice. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Berardi , Luca Boerio Using Subtyping in Program Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Gavin M. Bierman What is a Categorical Model of Intuitionistic Linear Logic? [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Briaud An explicit Eta rewrite rule. [Citation Graph (0, 0)][DBLP ] Conf ] Yann Coscoy , Gilles Kahn , Laurent Théry Extracting Text from Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Joëlle Despeyroux , Amy P. Felty , André Hirschowitz Higher-Order Abstract Syntax in Coq. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , Adolfo Piperno Expanding Extensional Polymorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Dowek Lambda-calculus, Combinators and the Comprehension Scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Neil Ghani ßn-Equality for Coproducts. [Citation Graph (0, 0)][DBLP ] Conf ] Healfdene Goguen Typed Operational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe de Groote A Simple Calculus of Exception Handling. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hofmann A Simple Model for Quotient Types. [Citation Graph (0, 0)][DBLP ] Conf ] M. Randall Holmes Untyped lambda-Calculus with Relative Typing. [Citation Graph (0, 0)][DBLP ] Conf ] Furio Honsell , Marina Lenisa Final Semantics for untyped lambda-calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Antonius J. C. Hurkens A Simplification of Girard's Paradox. [Citation Graph (0, 0)][DBLP ] Conf ] Hidetaka Kondoh Basic Properties of Data Types with Inequational Refinements. [Citation Graph (0, 0)][DBLP ] Conf ] Toshihiko Kurata , Masako Takahashi Decidable Properties of Intersection Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] François Leclerc Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq. [Citation Graph (0, 0)][DBLP ] Conf ] Paul-André Melliès Typed lambda-calculi with explicit substitutions may not terminate. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Padovani On Equivalence Classes of Interpolation Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Jaco van de Pol , Helmut Schwichtenberg Strict Functionals for Termination Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Pollack A Verified Typechecker. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Pravato , Simona Ronchi Della Rocca , Luca Roversi Categorical semantics of the call-by-value lambda-calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Ritter , Andrew M. Pitts A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard ML. [Citation Graph (0, 0)][DBLP ] Conf ] Alex K. Simpson Categorical completeness results for the simply-typed lambda-calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Springintveld Third-Order Matching in the Presence of Type Constructors. [Citation Graph (0, 0)][DBLP ] Conf ] 