Links und Funktionen
Sprachumschaltung

Navigationspfad
You are here: Home / People / Ulrich Schöpp


Inhaltsbereich

Dr. Ulrich Schöpp

Assistant
Email:

schoepp [at] tcs [dot] ifi [dot] lmu [dot] de (GPG Key)

Phone: +49-89-2180-9313
Fax: +49-89-2180-9338
Address:

Lehr- und Forschungseinheit für Theoretische Informatik
Institut für Informatik
LMU Munich
Oettingenstraße 67, D-80538 Munich, Germany

Office: E107

Meetings

  • 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)
  • DICE 2013: Developments in Implicit Computational Complexity (PC member)
  • LOLA 2012: Syntax and Semantics of Low Level Languages (invited speaker)
  • LCC 2012: Logic and Computational Complexity (invited speaker)
  • DICE 2012: Developments in Implicit Computational Complexity (invited speaker)
  • 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)

Past Activities

Teaching

(See the German version of this page.)

Software

Experimental IntML implementation

Publications, Slides, Drafts

Call by Value and a Basic Logic for Interaction
Draft, comments welcome.
On Interaction, Continuations and Defunctionalization
(long version)
Draft, comments welcome.
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), Shangai, China, 2010.
Last revision: 17 June 2010
Functional Programming in Sublinear Space
With Ugo Dal Lago.
Last revision: 18 March 2010; this version corrects a few typos; the original publication is available at www.springerlink.com.
In European Symposium on Programming (ESOP2010), Cyprus, 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 (long version)
With Martin Hofmann.
Electronic Colloquium on Computational Complexity (ECCC)
ECCC Technical Report TR08-090
(last revision: January 16, 2009)
Pure Pointer Programs with Iteration (long version)
With Martin Hofmann.
In Transactions on Computational Logic (ToCL), 2009, to appear
A Formalised Lower Bound on Undirected Graph Reachability
(Coq sources)
Revised version to appear in LPAR 2008
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 full 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, Appears 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

 

Document Actions


Funktionsleiste