WorldCat Identities

Felleisen, Matthias

Works: 41 works in 161 publications in 4 languages and 4,295 library holdings
Genres: Conference proceedings 
Roles: Author, Editor
Classifications: QA76.6, 005.133
Publication Timeline
Most widely held works by Matthias Felleisen
How to design programs an introduction to programming and computing by Matthias Felleisen( )
21 editions published between 2001 and 2010 in English and German and held by 1,356 WorldCat member libraries worldwide
This introduction to programming places computer science in the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process. This approach fosters a variety of skills -- critical reading, analytical thinking, creative synthesis, and attention to detail -- that are important for everyone, not just future computer programmers. The book exposes readers to two fundamentally new ideas. First, it presents program design guidelines that show the reader how to analyze a problem statement; how to formulate concise goals; how to make up examples; how to develop an outline of the solution, based on the analysis; how to finish the program; and how to test. Each step produces a well-defined intermediate product. Second, the book comes with a novel programming environment, the first one explicitly designed for beginners. The environment grows with the readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks. - Publisher
A little Java, a few patterns by Matthias Felleisen( )
14 editions published between 1998 and 2000 in English and Japanese and held by 895 WorldCat member libraries worldwide
Matthias Felleisen and Daniel Friedman use a small subset of Java to introduce pattern-directed program design. With their usual clarity and flair, they gently guide readers through the fundamentals of object-oriented programming and pattern-based design. Readers new to programming, as well as those with some background, will enjoy their learning experience as they work their way through Felleisen and Friedman's lessons
The little LISPer by Daniel P Friedman( Book )
30 editions published between 1986 and 1995 in English and held by 564 WorldCat member libraries worldwide
Software -- Programming Languages
The little Schemer by Daniel P Friedman( Book )
19 editions published between 1996 and 2007 in English and German and held by 311 WorldCat member libraries worldwide
Programming languages and systems 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings by Matthias Felleisen( )
7 editions published in 2013 in English and held by 310 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length invited talk, were carefully reviewed and selected from 120 full submissions. The contributions have been organized according to ten topical sections on programming techniques; programming tools; separation logic; gradual typing; shared-memory concurrency and verification; process calculi; taming concurrency; model checking and verification; weak-memory concurrency and verification; and types, inference, and analysis
The seasoned schemer by Daniel P Friedman( Book )
14 editions published between 1996 and 2011 in English and Japanese and held by 255 WorldCat member libraries worldwide
The little MLer by Matthias Felleisen( Book )
9 editions published in 1998 in English and held by 226 WorldCat member libraries worldwide
Realm of Racket learn to program, one game at a time! by Matthias Felleisen( )
4 editions published in 2013 in English and held by 161 WorldCat member libraries worldwide
Racket is the noble descendant of Lisp, a programming language renowned for its elegance and power. But while Racket retains the functional goodness of Lisp that makes programming purists drool, it was designed with beginning programmers in mind. Realm of Racket promises to make this language even more fun and accessible with its collection of comics and games. You'll follow Chad, a hapless college freshman, whose cartoon adventures introduce new programming skills in each chapter. As you begin to tackle more complex concepts, like recursion, mutable structs, lazy evaluation, and distributed programming, the games get more sophisticated-and more fun! By the end of the book you'll have programmed and played complete games like Robot Snake, Orc Battle, Dice of Doom, and Hungry Henry. Along the way, you'll learn to: * Master the quirks of Racket's syntax and semantics * Write concise and elegant functional programs * Create a graphical user interface using the 2htdp/image library * Create a server to handle true multiplayer games * Put your Racket skills to the test by taking on challenging end-of-chapter exercises Realm of Racket is a lighthearted guide that will teach you some serious programming. Programming just got more fun
Semantics engineering with PLT Redex by Matthias Felleisen( Book )
6 editions published in 2009 in English and held by 105 WorldCat member libraries worldwide
Le Petit Lispien by Daniel P Friedman( Book )
2 editions published in 1991 in French and held by 48 WorldCat member libraries worldwide
Abstract models of memory management by J. Gregory Morrisett( Book )
1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Most specifications of garbage collectors concentrate on the low-level algorithmic details of how to find and preserve accessible objects. Often, they focus on bit-level manipulations such as 'scanning stack frames, ' 'marking objects, ' 'tagging data, ' etc. While these details are important in some contexts, they often obscure the more fundamental aspects of memory management: what objects are garbage and why? We develop a series of calculi that are just low-level enough that we can express allocation and garbage collection, yet are sufficiently abstract that we may formally prove the correctness of various memory management strategies. By making the heap of a program syntactically apparent, we can specify memory actions as rewriting rules that allocate values on the heap and automatically dereference pointers to such objects when needed. This formulation permits the specification of garbage collection as a relation that removes portions of the heap without affecting the outcome of the evaluation. Our high-level approach allows us to compactly specify and prove correct a wide variety of memory management techniques, including standard trace-based garbage collectors (i.e., the family of copying and mark/sweep collectors), generational collection, and type-based tag-free collection. Furthermore, since the definition of garbage is based on the semantics of the underlying language instead of the conservative approximation of inaccessibility, we are able to specify and formally prove the idea that type inference can be used to collect some objects that are accessible but never used."
Realm of Racket by Matthias Felleisen( Book )
2 editions published in 2013 in English and held by 5 WorldCat member libraries worldwide
A syntactic approach to type soundness by Andrew K Wright( Book )
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages and (2) the use of rewriting techniques for the specification of the language semantics. The approach easily accommodates polymorphic functional languages and imperative language extensions that contain references, exceptions, continuations, and similar features. We illustrate the technique with a type soundness theorem for the core of STANDARD ML, which includes the first type soundness proof for polymorphic exceptions and continuations."
Proceedings of the third ACM SIGPLAN international conference on Functional programming by Matthias Felleisen( )
2 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
Is continuation-passing useful for data flow analysis? by Amr Sabry( Book )
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
The loss of information is due to the confusion of distinct procedure returns. 2. The analyzer based on the continuation semantics produces more accurate results than both direct analyzers, but again only in non-distributive analyses due to the duplication of continuations along every execution path. However, when the analyzer explicitly accounts for looping constructs, the results of the semantic-CPS analysis are no longer computable. In view of these results, we argue that, in practice, a direct data flow analysis that relies on some amount of duplication would be as satisfactory as a CPS analysis."
Fully abstract semantics for observably sequential languages by Robert Cartwright( Book )
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
For each set of error generators, the paper presents a fully abstract semantics for SPCF. If the set of error generators is empty, the semantics interprets all procedures -- including catch and throw -- as Berry-Curien sequential algorithms. If the language contains error generators, procedures denote manifestly sequential functions. The manifestly sequential functions form a Scott domain that is isomorphic to a domain of decision trees, which is the natural extension of the Berry- Curien domain of sequential algorithms in the presence of errors."
Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming 1998, Baltimore, Maryland, United States, September 26-29, 1998 by ACM SIGPLAN International Conference on Functional Programming( )
1 edition published in 2004 in English and held by 3 WorldCat member libraries worldwide
On the orthogonality of assignments and procedures in Algol by Stephen Weeks( Book )
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "According to folklore, Algol is an 'orthogonal' extension of a simple imperative programming language with a call-by-name functional language. The former contains assignments, branching constructs, and compound statements; the latter is based on the typed [lambda]-calculus. In an attempt to formalize the claim of 'orthogonality', we define a simple version of Algol and an extended [lambda]-calculus. The calculus includes the full [beta]-rule and rules for the reduction of assignment statements and commands. It has the usual properties, e.g., it satifies a Church-Rosser and Strong Normalization Theorem. In support of the claim that the imperative and functional components are orthogonal to each other, we show that the proofs of the corresponding theorems are combinations of separate Church-Rosser and Strong Normalization theorems for each sub-language. An acclaimed consequence of Algol's orthogonal design is the idea that the evaluation of a program has two distinct phases. The first phase corresponds to an unrolling of the program according to the usual [beta] and fixpoint reductions, which provide the formal counterpart to Algol's famous copy rule. The result of this phase is essentially an imperative program. The second phase executes the output of the first phase in the imperative fashion of a stack machine. Given our calculus, we can prove a Postponement Theorem and can thus formalize this phase separation."
Extended direct semantics by Matthias Felleisen( Book )
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
This paper presents an extensible framework for defining the denotational semantics of programming languages. In this framework the denotational definition of a programming language reduces to three simple steps: the specification of two subdomains -- a domain of observable values and a domain of extended values; the definition of two functions that describe the relationship between the elements of these domains, and the definition of a direct meaning function for program phrases. The paper includes a series of sample definitions that show that the framework can define a broad variety of complex programming languages in an extensible fashion. In addition, the paper proves that the extensible meaning of a core language is (the image of) a projection of the meaning of the extended language."
Transliterating Prolog into Scheme by Matthias Felleisen( Book )
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.52 (from 0.26 for Realm of R ... to 0.96 for Proceeding ...)
Alternative Names
フェライセン, M
フェライセン, マサイアス
English (127)
Japanese (6)
German (3)
French (2)