|
Conferences in DBLP
Type Inference by Coinductive Logic Programming. [Citation Graph (, )][DBLP]
About the Formalization of Some Results by Chebyshev in Number Theory. [Citation Graph (, )][DBLP]
A New Elimination Rule for the Calculus of Inductive Constructions. [Citation Graph (, )][DBLP]
A Framework for the Analysis of Access Control Models for Interactive Mobile Devices. [Citation Graph (, )][DBLP]
Proving Infinitary Normalization. [Citation Graph (, )][DBLP]
First-Class Object Sets. [Citation Graph (, )][DBLP]
Monadic Translation of Intuitionistic Sequent Calculus. [Citation Graph (, )][DBLP]
Towards a Type Discipline for Answer Set Programming. [Citation Graph (, )][DBLP]
Type Inference for a Polynomial Lambda Calculus. [Citation Graph (, )][DBLP]
Local Theory Specifications in Isabelle/Isar. [Citation Graph (, )][DBLP]
Axiom Directed Focusing. [Citation Graph (, )][DBLP]
A Type System for Usage of Software Components. [Citation Graph (, )][DBLP]
Merging Procedural and Declarative Proof. [Citation Graph (, )][DBLP]
Using Structural Recursion for Corecursion. [Citation Graph (, )][DBLP]
Manifest Fields and Module Mechanisms in Intensional Type Theory. [Citation Graph (, )][DBLP]
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq. [Citation Graph (, )][DBLP]
Coalgebraic Reasoning in Coq: Bisimulation and the lambda-Coiteration Scheme. [Citation Graph (, )][DBLP]
A Process-Model for Linear Programs. [Citation Graph (, )][DBLP]
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. [Citation Graph (, )][DBLP]
|