Conferences in DBLP
Thierry Coquand Completeness Theorems and lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Amy P. Felty A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Susumu Hayashi Can Proofs Be Animated By Games? [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Abel , Thierry Coquand Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Aehlig , Jolie G. de Miranda , C.-H. Luke Ong The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Baillot , Kazushige Terui A Feasible Algorithm for Typing in Elementary Affine Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe , Benjamin Grégoire , Fernando Pastawski Practical Inference for Type-Based Termination in a Polymorphic Setting. [Citation Graph (0, 0)][DBLP ] Conf ] Nick Benton , Benjamin Leperchey Relational Reasoning in a Nominal Semantics for Storage. [Citation Graph (0, 0)][DBLP ] Conf ] Yves Bertot Filters on CoInductive Streams, an Application to Eratosthenes' Sieve. [Citation Graph (0, 0)][DBLP ] Conf ] Ana Bove , Venanzio Capretta Recursive Functions with Higher Order Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Coppola , Ugo Dal Lago , Simona Ronchi Della Rocca Elementary Affine Logic and the Call-by-Value Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ferruccio Damiani Rank-2 Intersection and Polymorphic Recursion. [Citation Graph (0, 0)][DBLP ] Conf ] René David , Karim Nour Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Di Cosmo , François Pottier , Didier Rémy Subtyping Recursive Types Modulo Associative Commutative Products. [Citation Graph (0, 0)][DBLP ] Conf ] Ken-etsu Fujita Galois Embedding from Polymorphic Types into Existential Types. [Citation Graph (0, 0)][DBLP ] Conf ] Hugo Herbelin On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Hermant Semantic Cut Elimination in the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] James Laird The Elimination of Nesting in SPCF. [Citation Graph (0, 0)][DBLP ] Conf ] François Lamarche , Lutz Straßburger Naming Proofs in Classical Propositional Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Sam Lindley , Ian Stark Reducibility and TT-Lifting for Computation Types. [Citation Graph (0, 0)][DBLP ] Conf ] Stan Matwin , Amy P. Felty , István T. Hernádvölgyi , Venanzio Capretta Privacy in Data Mining Using Formal Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Greg Morrisett , Amal J. Ahmed , Matthew Fluet L3 : A Linear Language with Locations. [Citation Graph (0, 0)][DBLP ] Conf ] John Power , Miki Tanaka Binding Signatures for Generic Contexts. [Citation Graph (0, 0)][DBLP ] Conf ] Virgile Prevosto , Sylvain Boulmé Proof Contexts with Late Binding. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Schürmann , Adam Poswolsky , Jeffrey Sarnat The [triangle]-Calculus. Functional Programming with Higher-Order Encodings. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Selinger , Benoit Valiron A Lambda Calculus for Quantum Computation with Classical Control. [Citation Graph (0, 0)][DBLP ] Conf ] Paula Severi , Fer-Jan de Vries Continuity and Discontinuity in Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] François-Régis Sinot Call-by-Name and Call-by-Value as Token-Passing Interaction Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Urban , James Cheney Avoiding Equivariance in Alpha-Prolog. [Citation Graph (0, 0)][DBLP ] Conf ] Damiano Zanardini Higher-Order Abstract Non-interference. [Citation Graph (0, 0)][DBLP ] Conf ] 