Andrea asperti (45 risultati)

Condizione: New.

Paperback or Softback. Condizione: New. Mathematical Knowledge Management: Third International Conference, Mkm 2004, Bialowieza, Poland, September 19-21, 2004, Proceedings. Book.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. pp. 240.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Copyright Issues for MKM.- Efficient Retrieval of Mathematical Statements.- Formalizing Set Theory as it Is Actually Used.- Integrated Semantic Browsing of the Mizar Mathematical Library for Authoring Mizar Articles.- Informalising Formal Mathematics: Searching the Mizar Library with Latent Semantics.- Mathematical Service Matching Using Description Logic and OWL.- C-CoRN, the Constructive Coq Repository at Nijmegen.- Classifying Differential Equations on the Web.- Managing Heterogeneous Theories within a Mathematical Knowledge Repository.- Rough Concept Analysis - Theory Development in the Mizar System.- A Path to Faithful Formalizations of Mathematics.- Flexible Encoding of Mathematics on the Computer.- CPoint: Dissolving the Author's Dilemma.- On Diagrammatic Representation of Mathematical Knowledge.- Predicate Logic with Sequence Variables and Sequence Function Symbols.- A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics.- Theorem Proving and Proof Verification in the System SAD.- Adaptive Access to a Proof Planner.- Modeling Interactivity for Mathematics Learning by Demonstration.- Extraction of Logical Structure from Articles in Mathematics.- Improving Mizar Texts with Properties and Requirements.- An Investigation on the Dynamics of Direct-Manipulation Editors for Mathematics.- Intuitive and Formal Representations: The Case of Matrices.- Mathematical Libraries as Proof Assistant Environments.- Efficient Ambiguous Parsing of Mathematical Formulae.- An Architecture for Distributed Mathematical Web Services.- The Categorial Type of OpenMath Objects. …

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Regular Contributions.- Digitisation, Representation, and Formalisation Digital Libraries of Mathematics.- MKM from Book to Computer: A Case Study.- From Proof-Assistants to Distributed Libraries of Mathematics: Tips and Pitfalls.- Managing Digital Mathematical Discourse.- NAG Library Documentation.- On the Roles of LATEX and MathML in Encoding and Processing Mathematical Expressions.- Problems and Solutions for Markup for Mathematical Examples and Exercises.- An Annotated Corpus and a Grammar Model of Theorem Description.- A Query Language for a Metadata Framework about Mathematical Resources.- Information Retrieval in MML.- An Expert System for the Flexible Processing of XML -Based Mathematical Knowledge in a PROLOG-Environment.- Towards Collaborative Content Management and Version Control for Structured Mathematical Knowledge.- On the Integrity of a Repository of Formalized Mathematics.- A Theoretical Analysis of Hierarchical Proofs.- Comparing Mathematical Provers.- Translating Mizar for First Order Theorem Provers.- Invited Talk.- The Mathematical Semantic Web.…

paperback. Condizione: New. In shrink wrap. Looks like an interesting title.

Softcover. Condizione: Gut. Gebraucht - Gut Verlagsmängelex., X, 225 p. Also available online This book constitutes the refereed proceedings of the Second International Conference on Mathematical Knowledge Management, MKM 2003, held in Betinoro, Italy, in February 2003. The 16 revised full papers presented together with an invited paper were carefully reviewed and selected for presentation. Among the topics addressed are digitization, representation, formalization, proof assistants, distributed libraries of mathematics, NAG library, LaTeX, MathML, mathematics markup, theorem description, query languages for mathematical metadata, mathematical information retrieval, XML-based mathematical knowledge processing, semantic Web, mathematical content management, formalized mathematics repositories, theorem proving, and proof theory.…

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New. First account of the subject by two of its leading exponents. Essentially self-contained. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 408 pages, bibliography, index. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 27. Weight in Grams: 760. . 1998. hardcover. . . . .…

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Hardback. Condizione: New. All traditional implementation techniques for functional languages (mostly based on supercombinators, environments or continuations) fail to avoid useless repetition of work; they are not 'optimal' in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This book, the first in the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent Geometry of Interaction are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic. …

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: New. First account of the subject by two of its leading exponents. Essentially self-contained. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 408 pages, bibliography, index. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 27. Weight in Grams: 760. . 1998. hardcover. . . . . Books ship from the US and Ireland.…

Condizione: New. pp. 408.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Brand New. 392 pages. 9.50x6.50x1.00 inches. In Stock.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - All traditional implementation techniques for functional languages (mostly based on supercombinators, environments or continuations) fail to avoid useless repetition of work; they are not 'optimal' in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This book, the first in the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent Geometry of Interaction are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.…

Hardback. Condizione: New. All traditional implementation techniques for functional languages (mostly based on supercombinators, environments or continuations) fail to avoid useless repetition of work; they are not 'optimal' in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This book, the first in the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent Geometry of Interaction are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic. …