Types for Proofs and Programs de Stefano Berardi

Types for Proofs and Programs: International Workshop, TYPES '95, Torino, Italy, June 5 - 8, 1995 Selected Papers: Lecture Notes in Computer Science, cartea 1158

Stefano Berardi

Mario Coppo

This volume contains a refereed selection of revised full papers chosen from the contributions presented during the Third Annual Workshop held under the auspices of the ESPRIT Basic Research Action 6453 Types for Proofs and Programs. The workshop took place in Torino, Italy, in June 1995.
Type theory is a formalism in which theorems and proofs, specifications and programs can be represented in a uniform way. The 19 papers included in the book deal with foundations of type theory, logical frameworks, and implementations and applications; all in all they constitute a state-of-the-art survey for the area of type theory.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1061^.55 lei
20%

Preț: 307^.71 lei
20%

Preț: 438^.69 lei
20%

Preț: 645^.28 lei
Preț: 410^.88 lei
15%

Preț: 580^.46 lei
17%

Preț: 427^.22 lei
20%

Preț: 596^.46 lei
Preț: 449^.57 lei
20%

Preț: 353^.50 lei
20%

Preț: 1414^.79 lei
20%

Preț: 309^.90 lei
20%

Preț: 583^.40 lei
20%

Preț: 1075^.26 lei
20%

Preț: 310^.26 lei
20%

Preț: 655^.02 lei
20%

Preț: 580^.93 lei
20%

Preț: 340^.32 lei
18%

Preț: 938^.83 lei
20%

Preț: 591^.51 lei
15%

Preț: 438^.59 lei
20%

Preț: 337^.00 lei
Preț: 389^.48 lei
20%

Preț: 607^.39 lei
20%

Preț: 1024^.44 lei
20%

Preț: 579^.30 lei
20%

Preț: 763^.23 lei
20%

Preț: 453^.32 lei
20%

Preț: 575^.48 lei
20%

Preț: 585^.88 lei
20%

Preț: 825^.93 lei
20%

Preț: 763^.23 lei
17%

Preț: 360^.19 lei
20%

Preț: 1183^.14 lei
20%

Preț: 340^.32 lei
20%

Preț: 504^.57 lei
20%

Preț: 369^.12 lei
20%

Preț: 583^.40 lei
20%

Preț: 343^.62 lei
20%

Preț: 350^.21 lei
20%

Preț: 764^.89 lei
20%

Preț: 583^.40 lei
20%

Preț: 649^.49 lei
20%

Preț: 341^.95 lei
20%

Preț: 238^.01 lei
20%

Preț: 538^.29 lei

Cuprins

Implicit coercions in type systems.- A two-level approach towards lean proof-checking.- The greatest common divisor: A case study for program extraction from classical proofs.- Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids.- A constructive proof of the Heine-Borel covering theorem for formal reals.- An application of constructive completeness.- Automating inversion of inductive predicates in Coq.- First order marked types.- Internal type theory.- An application of co-inductive types in Coq: Verification of the alternating bit protocol.- Conservativity of equality reflection over intensional type theory.- A natural deduction approach to dynamic logic.- An algorithm for checking incomplete proof objects in type theory with localization and unification.- Decidability of all minimal models.- Circuits as streams in Coq: Verification of a sequential multiplier.- Context-relative syntactic categories and the formalization of mathematical text.- A simple model construction for the Calculus of Constructions.- Optimized encodings of fragments of type theory in first order logic.- Organization and development of a constructive axiomatization.