Typing plays an important role in software development. Types can be consid- ered as weak specifications of programs and checking that a program is of a certain type provides a verification that a program satisfies such a weak speci- fication. By translating a problem specification into a proposition in constructive logic, one can go one step further: the effectiveness and unifonnity of a con- structive proof allows us to extract a program from a proof of this proposition. Thus by the "proposition-as-types" paradigm one ...
Read More
Typing plays an important role in software development. Types can be consid- ered as weak specifications of programs and checking that a program is of a certain type provides a verification that a program satisfies such a weak speci- fication. By translating a problem specification into a proposition in constructive logic, one can go one step further: the effectiveness and unifonnity of a con- structive proof allows us to extract a program from a proof of this proposition. Thus by the "proposition-as-types" paradigm one obtains types whose elements are considered as proofs. Each of these proofs contains a program correct w.r.t. the given problem specification. This opens the way for a coherent approach to the derivation of provably correct programs. These features have led to a "typeful" programming style where the classi- cal typing concepts such as records or (static) arrays are enhanced by polymor- phic and dependent types in such a way that the types themselves get a complex mathematical structure. Systems such as Coquand and Huet's Calculus of Con- structions are calculi for computing within extended type systems and provide a basis for a deduction oriented mathematical foundation of programming. On the other hand, the computational power and the expressive (impred- icativity !) of these systems makes it difficult to define appropriate semantics.
Read Less
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $102.04, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2012 by Birkhauser.
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $79.64, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 2012 by Birkhäuser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $102.93, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2012 by Birkhauser.
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $131.17, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2012 by Birkhäuser.
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $170.05, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2012 by Birkhäuser.
Add this copy of Semantics of Type Theory: Correctness, Completeness and to cart. $124.32, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 2012 by Birkhäuser.
