Author: Manfred Broy
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Keywords: nato, program, calculi, design, july, asi, germany, august, study, proceedings, advanced, institute, marktoberdorf
Number of Pages: 409
Published: 1993-11
List price: unknow
ISBN-10: 354056943X
ISBN-13: 9783540569435
Author: C Hankin
Publisher: College Publications
Keywords: scientists, computer, calculi, lambda, introduction
Number of Pages: 180
Published: 2004-02-02
List price: $18.50
ISBN-10: 0954300653
ISBN-13: 9780954300654
The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then
Author: Alonzo Church
Publisher: Princeton University Press
Keywords: mathematics, studies, annals, conversion, lambda, calculi
Number of Pages: 77
Published: 1985-01-01
List price: $38.50
ISBN-10: 0691083940
ISBN-13: 9780691083940
Author: V.P. Orevkov
Publisher: Amer Mathematical Society
Keywords: steklov, institute, mathematics, proceedings, calculi, logico, mathematical, logical
Number of Pages: 183
Published: 1974-12-31
List price: $76.00
ISBN-10: 082183021X
ISBN-13: 9780821830215
Author: Ortrun Ibens
Publisher: Ios Pr Inc
Keywords: artificial, intelligence, infix, dissertations, contraints, tableau, calculi, disjunctive, connection
Number of Pages: 214
Published: 1999-03
List price: $34.00
ISBN-10: 1586031171
ISBN-13: 9781586031176
Automated deduction is one of the fundamental disciplines in the field of artificial intelligence. The purpose of systems for automated deduction is to find formal proofs for given conjectures by drawing conclusions from formally specified knowledge. Their main strength is that they allow a purely declarative description of knowledge, i.e., procedural information on the drawing of conclusions need not be provided. In combination with the indeterminism in the drawing of possible conclusions, however, the ability to handle declarative specifications introduces the aspect of searc
Authors:Roberto M. Amadio, Pierre-Louis Curien,
Publisher: Cambridge University Press
Keywords: theoretical, computer, science, tracts, cambridge, lambda, calculi, domains
Number of Pages: 504
Published: 1998-08-13
List price: $150.00
ISBN-10: 0521622778
ISBN-13: 9780521622776
This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modeling of various families of typed lambda calc
Authors:Howard Bowman, Rodolfo Gomez,
Publisher: Springer
Keywords: timed, concurrent, systems, untimed, modelling, theory, calculi, automata, concurrency
Number of Pages: 442
Published: 2005-12-08
List price: $129.00
ISBN-10: 1852338954
ISBN-13: 9781852338954
The book presents an extensive introduction to LOTOS highlighting how the approach differs from competitor techniques such as CCS and CSP. The notation is illustrated by a number of running examples and by using the LOTOS process calculus a spectrum of semantic models for concurrent systems are reviewed. Specifically, linear-time semantics; based on traces; branching-time semantics; using both labelled transition systems and refusals, are used to highlight true concurrency semantics using event structures. In addition to this a simple timed extension to LOTOS is introduced using running exa
