You have Guest access.
Log In
Stefano Berardi, Ferruccio Damiani and Ugo de’Liguoro
Front matter
1-18
Type Inference by Coinductive Logic Programming
19-31
About the Formalization of Some Results by Chebyshev in Number Theory
32-48
A New Elimination Rule for the Calculus of Inductive Constructions
49-63
A Framework for the Analysis of Access Control Models for Interactive Mobile Devices
64-82
Proving Infinitary Normalization
83-99
First-Class Object Sets
100-116
Monadic Translation of Intuitionistic Sequent Calculus
117-135
Towards a Type Discipline for Answer Set Programming
136-152
Type Inference for a Polynomial Lambda Calculus
153-168
Local Theory Specifications in Isabelle/Isar
169-185
Axiom Directed Focusing
186-202
A Type System for Usage of Software Components
203-219
Merging Procedural and Declarative Proof
220-236
Using Structural Recursion for Corecursion
237-255
Manifest Fields and Module Mechanisms in Intensional Type Theory
256-271
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
272-288
Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
289-305
A Process-Model for Linear Programs
306-322
Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info