X
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
    Book
    Book
    Introduction to combinatory logic / (1972)
    Cambridge :Univ. Press,
    Details
    UID:
    almafu_BV003112013
    Format: 170 S. : , Ill.
    ISBN: 0-521-09697-9
    Series Statement: London Mathematical Society: London Mathematical Society lecture note series 7
    Language: English
    Subjects: Mathematics
    RVK:
    SI 320
    RVK:
    SK 170
    Keywords: Kombinatorische Logik
    URL: Inhaltsverzeichnis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
    FU Berlin get availability status
    TU Berlin get availability status
  • 2
    Online Resource
    Online Resource
    Basic simple type theory / (1997)
    Cambridge :Cambridge University Press,
    Details
    UID:
    almahu_9948233529202882
    Format: 1 online resource (xi, 186 pages) : , digital, PDF file(s).
    ISBN: 9780511608865 (ebook)
    Series Statement: Cambridge tracts in theoretical computer science ; 42
    Content: Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015).
    Additional Edition: Print version: ISBN 9780521465182
    Language: English
    URL: https://doi.org/10.1017/CBO9780511608865
    URL: Volltext
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    HU Berlin
    FU Berlin
    UB Potsdam
  • 3
    Online Resource
    Online Resource
    Lambda-calculus and combinators, an introduction / (2008)
    Cambridge :Cambridge University Press,
    Details
    UID:
    almahu_9948233956202882
    Format: 1 online resource (xi, 345 pages) : , digital, PDF file(s).
    Edition: Second edition.
    ISBN: 9780511809835 (ebook)
    Content: Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index.
    Additional Edition: Print version: ISBN 9780521898850
    Language: English
    URL: https://doi.org/10.1017/CBO9780511809835
    URL: Volltext
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    HU Berlin
    FU Berlin
    UB Potsdam
  • 4
    Online Resource
    Online Resource
    Combinatory logic.; Volume II / (1972)
    Amsterdam :North-Holland Pub. Co.,
    Details
    UID:
    almahu_9947367929202882
    Format: 1 online resource (535 p.)
    ISBN: 1-282-30937-4 , 9786612309373 , 0-08-095477-4
    Series Statement: Studies in logic and the foundations of mathematics
    Content: Provability, Computability and Reflection
    Note: Description based upon print version of record. , Front Cover; Combinatory Logic; Copyright Page; Table of Contents; Preface; Explanation of Notations; Chapter 11 Addenda to Pure Combinatory Logic; A. Preliminaries; B. The weak theory of combinators; C. Bracket abstraction; D. The synthetic theory of combinators; E. Strong reduction; F. C-systems; Chapter 12 Foundations of the Illative Theory; A. Illative systems in general; B. Proper illative systems; C. Inferential systems for 2; D. CL-systems; Chapter 13 Combinatory Arithmetic; A. Foundations; B. Gödelian epitheory; C. Combinatory syntax; D. Typed combinatory arithmetic , Chapter 14 The Theory of FunctionalityA. Preliminaries; B. Properties of F-deductions; C. Deductive theory of F1; D. A ?-Formulation; E. An L-Formulation; F. The system F12; Chapter 15 The Theory of Restricted Generality; A. The systern F20; B. Deductive theory of F2; C. Finite formulations; D. The predicate calculus; Chapter 16 The Theory of Universal Generality; A. The system F30; B. Deductive theory of F31; C. Deductive theory of F32; D. Finite formulations; Chapter 17 Combinatory Type Theory; A. Formulations; B. Valuations and models; C. Kinds of type theory; Bibliography; Index , English
    Additional Edition: ISBN 0-7204-2208-6
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    HU Berlin
    FU Berlin
    Charité
  • 5
    Online Resource
    Online Resource
    Combinatory logic; Volume II (1972)
    Amsterdam : North-Holland Pub. Co
    Details
    UID:
    gbv_1655653946
    Format: Online Ressource (520 pages)
    Edition: Online-Ausg.
    ISBN: 9780080954776 , 0080954774 , 9780720422085
    Series Statement: Studies in logic and the foundations of mathematics v. 65
    Content: Provability, Computability and Reflection
    Note: Includes bibliographical references, index and errata. - Print version record , English
    Additional Edition: ISBN 0720422086
    Additional Edition: Erscheint auch als Druck-Ausgabe Combinatory logic. Volume II Amsterdam ; London : North-Holland Publishing Co, 1972
    Language: English
    Keywords: Kombinatorische Logik ; Electronic books ; Electronic books
    URL: lizenzpflichtig
    URL: Volltext
    URL: lizenzpflichtig
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Stabi Berlin
    UB Potsdam
  • 6
    Online Resource
    Online Resource
    DNA sequencing / (1983)
    Amsterdam ; : Elsevier Biomedical Press ;
    Details
    UID:
    almafu_9960073333202883
    Format: 1 online resource (397 p.)
    ISBN: 1-281-75638-5 , 9786611756383 , 0-08-085879-1
    Series Statement: Laboratory techniques in biochemistry and molecular biology ; 10
    Content: This volume provides a comprehensive description of the principles and methods used in DNA sequencing. Following a detailed introduction the chapters are: DNA sequencing; Chain terminator sequencing; Primed synthesis methods applied to DNA fragments cloned into phage M13; DNA sequencing by the Maxam-Gilbert chemical procedure; Computer methods for DNA sequencers; Appendices including contractions and special terms, cloning vectors, commercially available restriction endonucleases, and autoradiography.
    Note: Description based upon print version of record. , Front Cover; DNA Sequencing; Copyright Page; Contents; Acknowledgements; Chapter 1. Introduction; 1.1. Preliminary remarks; 1.2. Organisation of the book; 1.3. General background to DNA sequencing; Chapter 2. DNA Sequencing; 2.1. DNA sequencing by primed synthesis methods; 2.2. Detailed protocol for the 'plus' and 'minus' primed synthesis method; 2.3. Additional methods useful in conjunction with plus and minus method; 2.4. Discussion and summary; 2.5. Sequence analysis of short DNA fragments; Chapter 3. Chain terminator sequencing , 3.1. DNA sequencing with chain terminating inhibitors (Sanger et al., 1977)3.2. Sequencing by partial ribosubstitution; 3.3. Direct enzymatic method for sequencing double-stranded restriction fragments using dideoxynucleoside triphosphates (Maat and Smith. 1978); 3.4. The use of exonuclease Ill for preparing single-stranded DNA for use as a template in the chain terminator sequencing method (Smith, 1979, 1980); Chapter 4. Primed synthesis methods applied to DNA fragments cloned into phage M13; 4.1. General introduction , 4.2. Rapid random sequencing by shotgun cloning into single stranded phage vectors (Sanger et al., 1980)4.3. Detailed experimental procedures; Experimental procedures; 4.4. Dideoxy-nucleotide sequencing procedures; 4.5. Results; 4.6. Discussion; 4.7. Hints for reading sequencing gels; 4.8. Sequencing long single-stranded DNAs cloned in bacteriophage M13 using internal primers; 4.9. Sequencing cDNA from reverse transcripts of RNA; Key references; Chapter 5. DNA sequencing by the Maxam-Gilbert chemical procedure; 5.1. Introduction; 5.2. End-labelling DNA segments , 5.3. Separating the two labelled ends of complementary strands5.4. Strand separation; 5.5. Elution of DNA from polyacrylamide gels; 5.6. Base-specific chemical cleavage reactions; 5.7. Gel electrophoresis; 5.8. Reading the gel; 5.9. Experimental procedures; 5.10. Sequencing reactions (Maxam and Gilbert, 1980); 5.11. Trouble-shooting guide (Maxam and Gilbert, 1980); 5.12. Results; 5.13. Strategies for sequencing double-stranded DNA; Update; Update to chapter 4; Update to chapter 5; Appendices; Appendix 1. List of contractions and special terms; Appendix 2. Cloning vectors , Appendix 3. Commercially obtainable restriction endonucleases (1981)Appendix 4. Autoradiography; Appendix 5. Equipment; Appendix 6; Appendix 7. Nucleotide sequence of M13mp7; 7238 residues; Appendix 8. Restriction map of M13mp8 (7229 base pairs); Chapter 6. Computer methods for DNA sequencers; 1. Introduction; 2. Data storage and retrieval: the DB system; 3. Analysis: restriction sites, hairpin loops, translation, homologies; 4. Choosing hardware and software; 5. References; Appendix to chapter 6; Getting started with the DB system; Running the programs; References; Subject index , English
    Additional Edition: ISBN 0-444-80497-8
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    FU Berlin
    Charité
  • 7
    Book
    Book
    Lambda-calculus and combinators : an introduction (2008)
    Cambridge : Cambridge University Press
    Details
    UID:
    gbv_562451196
    Format: xi, 345 Seiten , Illustrationen , 24 cm
    ISBN: 9780521898850
    Content: Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index
    Note: Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index.
    Additional Edition: Erscheint auch als Online-Ausgabe Hindley, J. Roger Lambda-calculus and combinators, an introduction Cambridge, UK : Cambridge University Press, 2008 ISBN 0511415567
    Additional Edition: ISBN 0511809832
    Additional Edition: ISBN 9780511415562
    Additional Edition: ISBN 9780511809835
    Language: English
    Subjects: Computer Science , Mathematics
    RVK:
    ST 130
    RVK:
    SK 130
    Keywords: Lambda-Kalkül ; Kombinatorische Logik ; Einführung
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 8
    Book
    Book
    Introduction to combinators and [lambda]-calculus (1986)
    Cambridge [u.a.] : Cambridge Univ. Press
    Details
    UID:
    gbv_025133705
    Format: 360 S. , Ill., graph. Darst. , 8°
    ISBN: 0521268966 , 0521318394
    Series Statement: London Mathematical Society student texts 1
    Note: Literaturverz. S. 340 - 352
    Language: English
    Subjects: Mathematics
    RVK:
    SK 170
    RVK:
    SK 400
    Keywords: Kombinator ; Lambda-Kalkül ; Lambda-Kalkül ; Kombinatorische Logik ; Einführung
    URL: Inhaltsverzeichnis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
  • 9
    Book
    Book
    Introduction to combinators and [lamda]-calculus (1988)
    Cambridge [u.a.] : Cambridge Univ. Press
    Details
    UID:
    gbv_021753113
    Format: 360 S , Ill., graph. Darst
    Edition: Reprinted
    ISBN: 0521268966 , 0521318394
    Series Statement: London Mathematical Society student texts 1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
  • 10
    Book
    Book
    Combinatory logic; 1 (1974)
    Amsterdam : North-Holland
    Details
    UID:
    kobvindex_SLB956811
    Format: XVI, 417 S.
    Series Statement: Studies in logic and the foundations of mathematics 65
    Note: KOBVSLBP1 Z39.50 2021.05.06
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    SLB Potsdam get availability status
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages