Michael Sperber

Vorlesung Informatik 1, 35. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 18. Dezember 2008

Vorlesung Informatik 1, 33. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 16. Dezember 2008

Vorlesung Informatik 1, 34. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 11. Dezember 2008

Vorlesung Informatik 1, 31. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 11. Dezember 2008

Vorlesung Informatik 1, 32. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 09. Dezember 2008

Vorlesung Informatik 1, 29. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 09. Dezember 2008

Vorlesung Informatik 1, 30. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 04. Dezember 2008

Vorlesung Informatik 1, 27. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 04. Dezember 2008

Vorlesung Informatik 1, 28. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 02. Dezember 2008

Vorlesung Informatik 1, 25. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 02. Dezember 2008

Vorlesung Informatik 1, 26. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 27. November 2008

Vorlesung Informatik 1, 23. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 27. November 2008

Vorlesung Informatik 1, 24. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 25. November 2008

Vorlesung Informatik 1, 21. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 25. November 2008

Vorlesung Informatik 1, 22. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 20. November 2008

Vorlesung Informatik 1, 19. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 20. November 2008

Vorlesung Informatik 1, 20. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 18. November 2008

Vorlesung Informatik 1, 17. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 18. November 2008

Vorlesung Informatik 1, 18. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 13. November 2008

Vorlesung Informatik 1, 15. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 13. November 2008

Vorlesung Informatik 1, 16. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 11. November 2008

Vorlesung Informatik 1, 13. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 11. November 2008

Vorlesung Informatik 1, 14. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 06. November 2008

Vorlesung Informatik 1, 11. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 06. November 2008

Vorlesung Informatik 1, 12. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 04. November 2008

Vorlesung Informatik 1, 9. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 04. November 2008

Vorlesung Informatik 1, 10. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 30. Oktober 2008

Vorlesung Informatik 1, 7. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 30. Oktober 2008

Vorlesung Informatik 1, 8. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 28. Oktober 2008

Vorlesung Informatik 1, 5. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 28. Oktober 2008

Vorlesung Informatik 1, 6. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 23. Oktober 2008

Vorlesung Informatik 1, 3. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 23. Oktober 2008

Vorlesung Informatik 1, 4. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 21. Oktober 2008

Vorlesung Informatik 1, 1. Stunde (2008)

Vorlesung im WiSe 2008-2009; Dienstag, 21. Oktober 2008

Vorlesung Informatik 1, 2. Stunde (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 16. Oktober 2008

Author’s Guide to the ACM SIGPLAN Class (sigplanconf.cls) Association for Computing Machinery (2008)

Vorlesung im WiSe 2008-2009; Donnerstag, 16. Oktober 2008

Class Paul, C. Anagnostopoulos, Windfall Software, Guide Paul, C. Anagnostopoulos, ...

The programs and applications presented in this book have been included for their instructional value. They have been tested with care, but are not guaranteed for any particular purpose. The...

How ToHave Your Cake and Eat It, Too: Self-Applicable Online Partial Evaluation (2008)

ABSTRACT Developing a Stage Lighting System from Scratch (2008)

Abstract. We propose a hybrid approach to partial evaluation to achieve self-application of realistic online partial evaluators. Whereas the o ine approach to partial evaluation leads to e cient...

How To Have Your Cake and Eat It, Too: Self-Applicable Online Partial Evaluation (2008)

Lula is a system for computer-assisted stage lighting design and control. Whereas other systems for the same purpose are usually the results of long chains of incremental improvements of historic...

How to Add Threads to a Sequential LanguageWithout Getting Tangled Up (2008)

Martin Gasbichler, Michael Sperber

Abstract It is possible to integrate Scheme-style first-class continuations andthreads in a systematic way. We expose the design choices, discuss their consequences, and present semantical frameworks...

General Terms (2007)

Martin Gasbichler, Michael Sperber

We present a direct implementation of the shift and reset control operators in the Scheme 48 system. The new implementation improves upon the traditional technique of simulating shift and reset via...

Abstract A Functional Notation for Functional Dependencies (2007)

Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber

Functional dependencies help resolve many of the ambiguities that result from the use of multi-parameter type classes. They effectively enable writing programs at the type-level which significantly...

SUMMARY (2007)

Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Richard Kelsey, William Clinger, ...

This document describes rationales for some of the design decisions behind the Revised 6 Report on the Algorithmic Language Scheme. The focus is on changes made since the last revision on the report....

SUMMARY (2007)

Michael Sperber, William Clinger, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Richard Kelsey, ...

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis...

SUMMARY (2007)

Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Richard Kelsey, William Clinger, ...

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis...

Scheme — Standard Libraries — (2007)

Michael Sperber, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Richard Kelsey, William Clinger, ...

The report gives a defining description of the standard libraries of the programming language Scheme.

Author’s Guide to the ACM SIGPLAN Class (sigplanconf.cls) Association for Computing Machinery (2007)

Class Paul, C. Anagnostopoulos, Windfall Software, Guide Paul, C. Anagnostopoulos, ...

The programs and applications presented in this book have been included for their instructional value. They have been tested with care, but are not guaranteed for any particular purpose. The...

SUMMARY (2006)

Michael Sperber, William Clinger, R. Kent Dybvig, Matthew Flatt, Anton Van Straaten, Richard Kelsey, ...

The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis...

Preface (2005)

M Dcccx, X Indiana, J. Michael Ashley, Michael Sperber, Ronald Garcia, Andrew Lumsdaine

The purpose of the workshop is to discuss experience with, and future developments of, the Scheme programming language, as well as general aspects of Computer Science loosely centered on the general...

Preface (2005)

M Dcccx, X Indiana, J. Michael Ashley, Michael Sperber, Ronald Garcia, Andrew Lumsdaine

The purpose of the workshop is to discuss experience with, and future developments of, the Scheme programming language, as well as general aspects of Computer Science loosely centered on the general...

Functional logic overloading (2002)

Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber

Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conceptually predicates...

Processes vs. user-level threads in Scsh (2002)

Martin Gasbichler, Michael Sperber

The new version of scsh enables concurrent system programming with portable user-level threads. In scsh, threads behave like processes in many ways. Each thread receives its own set of process...

Computer-Assisted Lighting Design and Control (2001)

Sperber, Michael

This dissertation shows that computer-based lighting controlsystems can support the lighting design process considerably betterthan traditional consoles. It describes the Lula Project, a newsoftware...

Computer-assisted lighting design and control [Elektronische Ressource] / (2001)

Sperber, Michael.

Tübingen, University, Diss., 2001.

A functional notation for functional dependencies (2001)

Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber

Functional dependencies help resolve many of the ambiguities that result from the use of multi-parameter type classes. They e#ectively enable writing programs at the type-level which significantly...

Down with Emacs Lisp: dynamic scope analysis (2001)

Matthias Neubauer, Michael Sperber

It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely preserving structure...

Generation of LR Parsers by Partial Evaluation (2000)

ML and the Address Operator (1998)

this paper appeared in Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995 under the title "The Essence of LR Parsing."...

Michael Sperber, Peter Thiemann, Ng Rd

ML supports references to objects through mutable ref cells: A program can create a ref cell from an object, and subsequently replace the object accessible through the cell by another. Unfortunately,...

PLT MrEd: Graphical toolbox manual (1997)

Matthew Flatt, Robert Bruce Findler, Cormac Flanagan, Matthias Felleisen, Paul Steckler, Gann Bierner, ...

Copyright notice Copyright c○1996-99 PLT, Rice University Permission to make digital/hard copies and/or distribute this documentation for any purpose is hereby

Program Generation With Class (1997)

Peter Thiemann, Michael Sperber

. We have implemented a program generation library for polymorphically typed functional languages with lazy evaluation. The library combinators perform program generation by partial evaluation, a...

Distributed Partial Evaluation (1997)

Michael Sperber, Herbert Klaeren, Peter Thiemann

Partial evaluation is an automatic program transformation that optimizes programs by specialization. We speed up the specialization process by utilizing the natural coarse-grained parallelism...

Two for the Price of One: Composing Partial Evaluation and Compilation (1997)

Realistic Compilation by Partial Evaluation (1996)

One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformation for high-level...

Polyvariant Expansion and Compiler Generators (1996)

Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (clo- sures) and the transformation to tail-recursive style. We show...

Peter Thiemann, Michael Sperber

Polyvariant expansion is a binding-time-improving transformation for offline partial evaluation. We show how to achieve it automatically for a higher-order functional language using the interpretive...

Bootstrapping Higher-Order Program Transformers from Interpreters (1996)

Michael Sperber, Robert Glück, Robert Gl Uck, Peter Thiemann

Partial evaluation can automatically generate program transformers from interpreters. In the context of functional languages, we investigate the design space of higher-order interpreters to achieve...

Bootstrapping Higher-Order Program Transformers from Interpreters (1996)

Michael Sperber, Robert Glück, Robert Gl Uck, Peter Thiemann

Partial evaluation can automatically generate program transformers from interpreters. In the context of functional languages, we investigate the design space of higher-order interpreters to achieve...

Bootstrapping higher-order program transformers from interpreters (1996)

The Essence of LR Parsing (1995)

Partial evaluation can automatically generate program transformers from interpreters. In the context of functional languages, we investigate the design space of higher-order interpreters to achieve...

The Essence of LR Parsing (1995)

Partial evaluation can turn a generalparser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We use an inherently...