Conferences in DBLP
Frank Pfenning On a Logical Foundation for Explicit Substitutions. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Baillot From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Abel Strong Normalization and Equi-(Co)Inductive Types. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Berardi Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves. [Citation Graph (0, 0)][DBLP ] Conf ] William Blum , C.-H. Luke Ong The Safe Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Boulmé Intuitionistic Refinement Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ana Bove , Venanzio Capretta Computation by Prophecy. [Citation Graph (0, 0)][DBLP ] Conf ] René David , Karim Nour An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. [Citation Graph (0, 0)][DBLP ] Conf ] Denis Cousineau , Gilles Dowek Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo. [Citation Graph (0, 0)][DBLP ] Conf ] José Espírito Santo Completing Herbelin's Programme. [Citation Graph (0, 0)][DBLP ] Conf ] José Espírito Santo , Ralph Matthes , Luis Pinto Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Claudia Faggian , Mauro Piccolo Ludics is a Model for the Finitary Linear Pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo P. Fiore Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Benedetto Intrigila , Richard Statman The Omega Rule is P1 1 -Complete in the lambdabeta -Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Jiang , Guo-Qiang Zhang Weakly Distributive Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Patricia Johann , Neil Ghani Initial Algebra Semantics Is Enough! [Citation Graph (0, 0)][DBLP ] Conf ] Oleg Kiselyov , Chung-chieh Shan A Substructural Type System for Delimited Continuations. [Citation Graph (0, 0)][DBLP ] Conf ] Dariusz Kusmierek The Inhabitation Problem for Rank Two Intersection Types. [Citation Graph (0, 0)][DBLP ] Conf ] Sam Lindley Extensional Rewriting with Sums. [Citation Graph (0, 0)][DBLP ] Conf ] James Lipton , Susana Nieva Higher-Order Logic Programming Languages with Constraints: A Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Yves Marion Predicative Analysis of Feasibility and Diagonalization. [Citation Graph (0, 0)][DBLP ] Conf ] Damiano Mazza Edifices and Full Abstraction for the Symmetric Interaction Combinators. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Mostrous , Nobuko Yoshida Two Session Typing Systems for Higher-Order Mobile Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Koji Nakazawa An Isomorphism Between Cut-Elimination Procedure and Proof Reduction. [Citation Graph (0, 0)][DBLP ] Conf ] Olha Shkaravska , Ron van Kesteren , Marko C. J. D. van Eekelen Polynomial Size Analysis of First-Order Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Makoto Tatsuta Simple Saturated Sets for Disjunction and Second-Order Existential Quantification. [Citation Graph (0, 0)][DBLP ] Conf ] Lionel Vaux Convolution [`(l)]m-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] 