Travelled to:1 × Cyprus
1 × France
1 × Hungary
1 × The Netherlands
1 × USA
1 × United Kingdom
2 × Italy
2 × Poland
Collaborated with:∅ M.Hofmann U.D.Lago I.Stark A.K.Simpson R.Ramyaa
Talks about:program (5) pointer (3) space (3) interact (2) type (2) pure (2) use (2) defunctionalis (1) defunction (1) sublinear (1)
Person: Ulrich Schöpp
DBLP: Sch=ouml=pp:Ulrich
Contributed to:
2014
2013
2013
2010
2009
200820072006200420022017Wrote 11 papers:
- PPDP-2014-Schopp #low level #source code #using
- Organising Low-Level Programs using Higher Types (US), pp. 199–210.
- FoSSaCS-2013-HofmannRS #morphism #pointer #source code
- Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.
- TLCA-2013-Schopp #continuation #interactive #on the
- On Interaction, Continuations and Defunctionalization (US), pp. 205–220.
- ESOP-2010-LagoS #functional #programming #sublinear
- Functional Programming in Sublinear Space (UDL, US), pp. 205–225.
- LICS-2009-HofmannS #pointer #reachability #source code
- Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
- CSL-2008-HofmannS #pointer #source code
- Pure Pointer Programs with Iteration (MH, US), pp. 79–93.
- LICS-2007-Schopp #bound #logic
- Stratified Bounded Affine Logic for Logarithmic Space (US), pp. 411–420.
- CSL-2006-Schopp #interactive
- Space-Efficient Computation by Interaction (US), pp. 606–621.
- CSL-2004-SchoppS #dependent type #type system
- A Dependent Type Theory with Names and Binding (US, IS), pp. 235–249.
- FoSSaCS-2002-SchoppS #process #using #verification
- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes (US, AKS), pp. 372–386.
- PPDP-2017-Schopp #composition
- Defunctionalisation as modular closure conversion (US), pp. 175–186.