feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    b3kat_BV035717508
    Format: 1 Online-Ressource (XVII, 321 S.)
    ISBN: 3540582444 , 0387582444
    Series Statement: Lecture notes in computer science 828
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Isabelle
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Berlin [u.a.] :Springer,
    UID:
    almahu_BV009676056
    Format: XVII, 321 S.
    ISBN: 3-540-58244-4 , 0-387-58244-4
    Series Statement: Lecture notes in computer science 828
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Isabelle
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960119237702883
    Format: 1 online resource (xviii, 476 pages) : , digital, PDF file(s).
    Edition: Second edition.
    ISBN: 0-521-56543-X , 0-511-81132-2
    Content: The new edition of this successful and established textbook retains its two original intentions of explaining how to program in the ML language, and teaching the fundamentals of functional programming. The major change is the early and prominent coverage of modules, which are extensively used throughout. In addition, the first chapter has been totally rewritten to make the book more accessible to those without experience of programming languages. The main features of new Standard Library for the revised version of ML are described and many new examples are given, while references have also been updated. Dr Paulson has extensive practical experience of ML and has stressed its use as a tool for software engineering; the book contains many useful pieces of code, which are freely available (via the Internet) from the author. He shows how to use lists, trees, higher-order functions and infinite data structures. Many illustrative and practical examples are included.. Efficient functional implementations of arrays, queues, priority queues, etc. are described. Larger examples include a general top-down parser, a lambda-calculus reducer and a theorem prover. The combination of careful explanation and practical advice will ensure that this textbook continues to be the preferred text for many courses on ML.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , English
    Additional Edition: ISBN 1-107-26377-8
    Additional Edition: ISBN 0-521-57050-6
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Cambridge u.a. :Cambridge Univ. Pr.,
    UID:
    almafu_BV002290866
    Format: XIII, 302 S.
    Edition: 1. publ.
    ISBN: 0-521-34632-0
    Series Statement: Cambridge tracts in theoretical computer science. 2.
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    RVK:
    RVK:
    Keywords: Berechenbare Funktion ; Mathematische Logik ; Berechenbarkeit ; Mathematische Logik ; Logische Programmierung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960117033002883
    Format: 1 online resource (xiii, 302 pages) : , digital, PDF file(s).
    ISBN: 0-511-52660-1
    Series Statement: Cambridge tracts in theoretical computer science ; 2
    Content: This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , English
    Additional Edition: ISBN 0-521-39560-7
    Additional Edition: ISBN 0-521-34632-0
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_BV014201123
    Format: XIII, 218 S.
    ISBN: 3-540-43376-7
    Series Statement: Lecture notes in computer science 2283 : Tutorial
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 3-540-45949-9
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: HOL ; Isabelle ; HOL ; Funktionale Programmierung ; HOL ; Formale Methode ; Aufsatzsammlung
    URL: Cover
    Author information: Nipkow, Tobias 1958-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Cambridge u.a. :Cambridge Univ. Press,
    UID:
    almahu_BV006618355
    Format: XIII, 302 S.
    Edition: 1. paperback ed.
    ISBN: 0-521-39560-7 , 0-521-34632-0
    Series Statement: Cambridge tracts in theoretical computer science 2
    Note: Literaturverz. S. 289 - 295
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Berechenbarkeit ; Mathematische Logik ; Berechenbare Funktion ; Mathematische Logik ; Logische Programmierung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Book
    Book
    Cambridge u.a. : Cambridge Univ. Press
    UID:
    b3kat_BV011089012
    Format: XVIII, 476 S. , graph. Darst.
    Edition: 2. ed.
    ISBN: 052156543X
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Standard ML ; Funktionale Programmiersprache ; Funktionale Programmierung ; ML ; Programmiersprache ; Aufgabensammlung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Berlin [u.a.] : Springer
    UID:
    gbv_595125131
    Format: Online-Ressource (XVII, 321 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540485865
    Series Statement: Lecture notes in computer science 828
    Content: Foundations -- Getting started with Isabelle -- Advanced methods -- Basic use of Isabelle -- Proof management: The subgoal module -- Tactics -- Tacticals -- Theorems and forward proof -- Theories, terms and types -- Defining logics -- Syntax transformations -- Substitution tactics -- Simplification -- The classical reasoner -- Basic concepts -- First-order logic -- Zermelo-Fraenkel set theory -- Higher-order logic -- First-order sequent calculus -- Constructive Type Theory -- Syntax of Isabelle Theories.
    Content: As a generic theorem prover, Isabelle supports a variety of logics. Distinctive features include Isabelle's representation of logics within a meta-logic and the use of higher-order unification to combine inference rules. Isabelle can be applied to reasoning in pure mathematics or verification of computer systems. This volume constitutes the Isabelle documentation. It begins by outlining theoretical aspects and then demonstrates the use in practice. Virtually all Isabelle functions are described, with advice on correct usage and numerous examples. Isabelle's built-in logics are also described in detail. There is a comprehensive bebliography and index. The book addresses prospective users of Isabelle as well as researchers in logic and automated reasoning.
    Note: Literaturverz. S. [301] - 304
    Additional Edition: ISBN 3540582444
    Additional Edition: ISBN 9783540582441
    Additional Edition: Erscheint auch als Druck-Ausgabe Paulson, Lawrence C. Isabelle Berlin : Springer, 1994 ISBN 3540582444
    Additional Edition: ISBN 0387582444
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Isabelle
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186344802883
    Format: 1 online resource (XIX, 329 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48586-4
    Series Statement: Lecture Notes in Computer Science, 828
    Content: As a generic theorem prover, Isabelle supports a variety of logics. Distinctive features include Isabelle's representation of logics within a meta-logic and the use of higher-order unification to combine inference rules. Isabelle can be applied to reasoning in pure mathematics or verification of computer systems. This volume constitutes the Isabelle documentation. It begins by outlining theoretical aspects and then demonstrates the use in practice. Virtually all Isabelle functions are described, with advice on correct usage and numerous examples. Isabelle's built-in logics are also described in detail. There is a comprehensive bebliography and index. The book addresses prospective users of Isabelle as well as researchers in logic and automated reasoning.
    Note: Bibliographic Level Mode of Issuance: Monograph , Foundations -- Getting started with Isabelle -- Advanced methods -- Basic use of Isabelle -- Proof management: The subgoal module -- Tactics -- Tacticals -- Theorems and forward proof -- Theories, terms and types -- Defining logics -- Syntax transformations -- Substitution tactics -- Simplification -- The classical reasoner -- Basic concepts -- First-order logic -- Zermelo-Fraenkel set theory -- Higher-order logic -- First-order sequent calculus -- Constructive Type Theory -- Syntax of Isabelle Theories. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58244-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages