Games and Full Abstraction for a Functional Metalanguage with Recursive Types PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Games and Full Abstraction for a Functional Metalanguage with Recursive Types PDF full book. Access full book title Games and Full Abstraction for a Functional Metalanguage with Recursive Types by Guy McCusker. Download full books in PDF and EPUB format.
Author: Guy McCusker
Publisher: Springer Science & Business Media
ISBN: 1447106156
Category : Computers
Languages : en
Pages : 195
Get Book
Book Description
This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in £, which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him.
Author: Guy McCusker
Publisher: Springer Science & Business Media
ISBN: 1447106156
Category : Computers
Languages : en
Pages : 195
Get Book
Book Description
This book is a minor revision of the thesis submitted in August 1996; no major changes have been made. However, I would like to take this opportunity to mention that since the thesis was written, discoveries have been made which would allow a substantial simplification and strengthening of the results in Chapters 3 and 6. In particular, it is now possible to model sums correctly in the category I as well as in £, which means that the definability results of Chapter 6 can be stated and proved at the intensional level, making them simpler and much closer in spirit to the original proofs of Abramsky, Jagadeesan, Malacaria, Hyland, Ong and Nickau [10,61,79]. This also leads quite straightforwardly to an understanding of call-by-value languages. Details of these improvements can be found in [14,73]. It is also worth mentioning that progress has been made on some of the topics suggested for future research in Chapter 7. In particular, fully abstract models have been found for various kinds of languages with local variables [8,13-16], and a fully complete games model of the polymorphic language System F has been constructed by Hughes [59]. Guy McCusker February 1998 Acknowledgements First of all, I must thank my supervisor, Samson Abramsky. It was he who first introduced me to game semantics and suggested avenues of research in the area; this book would certainly not exist were it not for him.
Author: Samson Abramsky
Publisher: Springer
ISBN: 3540454136
Category : Mathematics
Languages : en
Pages : 441
Get Book
Book Description
This book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus.
Author: Josep Diaz
Publisher: Springer
ISBN: 3540278362
Category : Computers
Languages : en
Pages : 1272
Get Book
Book Description
The 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004) was held from July 12 to July 16 in Turku, Finland. This volume contains all contributed papers presented at ICALP 2004, together with the invitedlecturesbyPhilippeFlajolet(INRIA),RobertHarper(CarnegieMellon), Monika Henzinger (Google), Martin Hofmann (Munich), Alexander Razborov (Princeton and Moscow), Wojciech Rytter (Warsaw and NJIT), and Mihalis Yannakakis (Stanford). ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS). The ?rst ICALP took place in 1972 and the ICALP program currently consists of track A (focusing on algorithms, automata, complexity, and cryptography) and track B (focusing on databases, logics, semantics, and principles of programming). Inresponsetothecallforpapers,theprogramcommitteereceived379papers, 272 for track A and 107 for track B. This is the highest number of submitted papersinthehistoryofICALPconferences.Theprogramcommitteesselected97 papersforinclusionintothescienti?cprogram.Theprogramcommitteefortrack A met on March 27 and 28 in Barcelona and selected 69 papers from track A. TheprogramcommitteefortrackBselected28papersfromtrackBinthecourse of an electronic discussion lasting for two weeks in the second half of March. The selections were based on originality, quality, and relevance to theor- ical computer science. We wish to thank all authors who submitted extended abstracts for consideration, the program committee for its hard work, and all referees who assisted the program committee in the evaluation process.
Author: Thomas Streicher
Publisher: World Scientific Publishing Company
ISBN: 9813106867
Category : Computers
Languages : en
Pages : 132
Get Book
Book Description
This textbook provides a basis for a PhD course on domain-theoretic semantics of functional programming languages and their meta-mathematical properties. It introduces basic domain theory and the technique of logical relations as developed by Scott and Plotkin. The solution of recursive domain equations is explained in detail. A complete discussion of the famous full abstraction problem for PCF (a functional Kernel language due to Scott and Plotkin) is given including a construction of the fully abstract Milner model using Kripke logical relations. A final chapter introduces computability in Scott domains and shows that this model is fully abstract and universal for appropriate extensions of PCF by parallel language constructs.
Author: Andrew D. Gordon
Publisher: Springer Science & Business Media
ISBN: 3540008977
Category : Computers
Languages : en
Pages : 452
Get Book
Book Description
This book constitutes the refereed proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2003, held in Warsaw, Poland in April 2003. The 26 revised full papers presented together with an invited paper were carefully reviewed and selected from 96 submissions. Among the topics covered are algebraic models; automata and language theory; behavioral equivalences; categorical models; computation processes over discrete and continuous data; computation structures; logics of programs; models of concurrent, reactive, distributed, and mobile systems; process algebras and calculi; semantics of programming languages; software specification and refinement; transition systems; and type systems and type theory.
Author: Andrew M. Pitts
Publisher: Cambridge University Press
ISBN: 0521580579
Category : Computers
Languages : en
Pages : 375
Get Book
Book Description
The aim of this volume is to present modern developments in semantics and logics of computation in a way that is accessible to graduate students. The book is based on a summer school at the Isaac Newton Institute and consists of a sequence of linked lecture course by international authorities in the area. The whole set have been edited to form a coherent introduction to these topics, most of which have not been presented pedagogically before.
Author: Robin Milner
Publisher: MIT Press
ISBN: 9780262161886
Category : Computers
Languages : en
Pages : 748
Get Book
Book Description
This collection of essays reflects the breadth of research in computer science. Following a biography of Robin Milner it contains sections on semantic foundations; programming logic; programming languages; concurrency; and mobility.
Author: Christel Baier
Publisher: Springer
ISBN: 3319893661
Category : Computers
Languages : en
Pages : 586
Get Book
Book Description
This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The 31 papers presented in this volume were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections named: semantics; linearity; concurrency; lambda-calculi and types; category theory and quantum control; quantitative models; logics and equational theories; and graphs and automata.
Author: Igor Walukiewicz
Publisher: Springer
ISBN: 3540247270
Category : Computers
Languages : en
Pages : 543
Get Book
Book Description
ETAPS 2004 was the seventh instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), 23 satellite workshops, 1 tutorial, and 7 invited lectures (not including those that are speci?c to the satellite events). The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools that support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues inv- ved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
Author: Peter O'Hearn
Publisher: Springer Science & Business Media
ISBN: 147573851X
Category : Computers
Languages : en
Pages : 345
Get Book
Book Description
To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language in a way that reflects the semantics of the language. little is said about such struc turing in compiler texts that are intended to cover a wide variety of program ming languages. More is said in the Iiterature on semantics-directed compiler construction [1] but here too the viewpoint is very general (though limited to 1 languages with a finite number of syntactic types). On the other handl there is a considerable body of work using the continuation-passing transformation to structure compilers for the specific case of call-by-value languages such as SCHEME and ML [21 3]. ln this paperl we will describe a method of structuring the translation of ALGOL-like languages that is based on the functor-category semantics devel oped by Reynolds [4] and Oles [51 6]. An alternative approach using category theory to structure compilers is the early work of F. L. Morris [7]1 which anticipates our treatment of boolean expressionsl but does not deal with procedures. 2 Types and Syntax An ALGOL-like language is a typed lambda calculus with an unusual repertoire of primitive types. Throughout most of this paper we assume that the primi tive types are comm(and) int(eger)exp(ression) int(eger)acc(eptor) int(eger)var(iable) I and that the set 8 of types is the least set containing these primitive types and closed under the binary operation -.
