Links und Funktionen
Sprachumschaltung

Navigationspfad
Sie sind hier: Startseite / Mitarbeiter / Ulrich Schöpp


Inhaltsbereich

PD Dr. Ulrich Schöpp

Akademischer Oberrat auf Zeit ~ Lecturer

E-Mail: schoepp [at] tcs [dot] ifi [dot] lmu [dot] de
Telefon: +49-89-2180-9313
Fax: +49-89-2180-9338
Adresse: Lehr- und Forschungseinheit für
Theoretische Informatik
Institut für Informatik
Ludwig-Maximilians-Universität München
Oettingenstr.67, 80538 München
Raum: E 107

Previous activities:

Events

  • APLAS 2018: Asian Symposium on Programming Languages and Systems (contributed talk)
  • GaLoP 2018: Games for Logic and Programming Languages (invited speaker)
  • LCC 2018: Logic and Computational Complexity (PC member)
  • PPDP 2017: Principles and Practice of Declarative Programming (PC member)
  • Shonan school on "Semantics of Effects, Resources, and Applications"
  • APLAS 2016: Asian Symposium on Programming Languages and Systems (PC member)
  • LOLA 2015: Syntax and Semantics of Low-Level Languages (PC co-chair)
  • MFPS 2015: Mathematical Foundations of Programming Semantics XXXI (PC member)
  • GaLoP 2015: Games for Logic and Programming Languages (PC member)
  • TYPES 2015: Types for Proofs and Programs (PC member)
  • FOSSACS 2015: Foundations of Software Science and Computation Structures (PC member)
  • DICE 2014: Developments in Implicit Computational Complexity (PC chair)
  • APLAS 2013: Asian Symposium on Programming Languages and Systems (PC member)
  • FOPARA 2013: Foundational and Practical Aspects of Resource Analysis (PC member)
  • LOLA 2012: Syntax and Semantics of Low Level Languages (PC member)
  • LCC 2012: Logic and Computational Complexity (PC member)
  • DICE 2012: Developments in Implicit Computational Complexity (PC member)
  • MSFP 2012: Mathematically Structured Functional Programming (PC member)
  • SOFSEM 2012: International Conference on Current Trends in Theory and Practice of Computer Science (PC member)
  • LOLA 2010: Syntax and Semantics of Low Level Languages (PC member)

Teaching (German)

Sprechstundentermine bitte per E-Mail vereinbaren.

Software

Publications, Slides and Drafts

The Geometry of Interaction as a Module System
Short version will appear in Asian Symposium on Programming Languages and Systems (APLAS 2018), Wellington, New Zealand, 2018
Slides from Shonan School Semantics of Effects, Resources, and Applications:
Lecture 1, Lecture 2
Defunctionalisation as Modular Closure Conversion
prototype implementation
In Principles and Practice of Declarative Programming (PPDP 2017), Namur, Belgium, 2017
Computation-by-Interaction for Space-Bounded Functional Programming (preprint)
With Ugo Dal Lago.
In Information and Computation, 2016
From Call-by-Value to Interaction by Typed Closure Conversion
In Asian Symposium on Programming Languages and Systems (APLAS 2015), 2015
Computation-by-Interaction for Structuring Low-Level Computation
Habilitation Thesis, 2015
On the Relation of Interaction Semantics to Continuations and Defunctionalization
(long version of TLCA 2013 paper)
In Logical Methods in Computer Science, LMCS-10(4:10) 2014.
Call by Value in a Basic Logic for Interaction
In Asian Symposium on Programming Languages and Systems (APLAS 2014), Singapore, 2014
Slides from talk at Workshop on Higher Order Computation: Types, Complexity, Applications
Organising Low-Level Programs using Higher Types
In Principles and Practice of Declarative Programming (PPDP 2014), Canterbury, UK, 2014
On Interaction, Continuations and Defunctionalization
In Typed Lambda Calculi and Applications (TLCA 2013), Eindhoven, 2013, ©Springer-Verlag
Pure Pointer Programs and Tree Isomorphism
With Ramyaa and Martin Hofmann.
In Foundations of Software Science and Computation Structures (FOSSACS13), Rome, 2013, ©Springer-Verlag
Computation-by-Interaction with Effects
In ASIAN Symposium on Programming Languages and Systems (APLAS 2011), Taiwan, 2011, ©Springer-Verlag
Type Inference for Sublinear Space Functional Programming
With Ugo Dal Lago.
Revised version appears in ASIAN Symposium on Programming Languages and Systems (APLAS 2010), Shanghai, China, 2010.
Last revision: 17.06.2010
Functional Programming in Sublinear Space
With Ugo Dal Lago.
Last revision: 18.03.2010; This version corrects a few typographical errors. The original paper is available at www.springerlink.com.
In European Symposium on Programming (ESOP2010), Zypern, 2010, LNCS 6012, ©Springer-Verlag
Slides: OASIS Seminar, Oxford University (December 2009)
Pointer Programs and Undirected Reachability
With Martin Hofmann.
In Logic in Computer Science (LICS09), Los Angeles, USA, ©IEEE
Slides: LICS09 (August 2009)
Pointer Programs and Undirected Reachability (ausführliche Version)
With Martin Hofmann.
Electronic Colloquium on Computational Complexity (ECCC)
ECCC Technical Report TR08-090
(last revision: 16 January 2009)
Pure Pointer Programs with Iteration (ausführliche Version)
With Martin Hofmann.
In Transactions on Computational Logic (ToCL), 2009
A Formalised Lower Bound on Undirected Graph Reachability
(Coq sources)
In LPAR 2008, Doha, Katar, ©Springer-Verlag
Pure Pointer Programs with Iteration
With Martin Hofmann.
In Computer Science Logic (CSL08), Bertinoro, Italy
LNCS 5213, 2008, ©Springer-Verlag
Stratified Bounded Affine Logic for Logarithmic Space
In Logic in Computer Science (LICS07), Wroclaw, Poland, ©IEEE
Draft long version, comments welcome!
Slides: LICS07 (July 2007)
Space-efficient Computation by Interaction – A Type System for Logarithmic Space
In Computer Science Logic (CSL06), Szeged, Hungary
LNCS 4207, 2006, ©Springer-Verlag
Slides: CSL06 (September 2006)
Modelling Generic Judgements
In International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP06), Seattle, USA, 2006, Erscheint in ENTCS 174(5), 2007
Slides: LFMTP06 (August 2006)
Names and Binding in Type Theory
PhD Thesis, The University of Edinburgh, 2006
Slides: ICMS07 (May 2007)
A Dependent Type Theory with Names and Binding
With Ian Stark.
In Computer Science Logic (CSL04), Karpacz, Poland
LNCS, 3210, pages 235–249, 2004
Slides: CSL04 (September 2004), Logic and Semantics Club at LFCS (August 2004)
Verifying Temporal Properties using Explicit Approximants: Completeness for Context-free Processes. (Older version with outline proofs)
With Alex Simpson.
In Proceedings of Foundations of Software Science and Computation Structures (FOSSACS02), Grenoble, France
LNCS, 2303, pages 372–386, 2002, ©Springer-Verlag
Slides: FoSSaCS02 (April 2002), Logic and Semantics Club at LFCS (February 2002)
Formal Verification of Processes
MSc thesis, The University of Edinburgh, 2001

Artikelaktionen


Funktionsleiste