Travelled to:1 × Belgium
1 × China
1 × Czech Republic
1 × Denmark
1 × Estonia
1 × Iceland
1 × Portugal
1 × Slovenia
1 × Sweden
1 × Switzerland
2 × Canada
2 × Japan
21 × USA
3 × Italy
3 × Spain
3 × The Netherlands
4 × France
4 × United Kingdom
5 × Germany
Collaborated with:∅ M.Neubauer P.Heidegger M.Sperber M.Sulzmann S.Wehr A.Bieniusa M.Keil L.Fennell M.Degen S.H.Jensen A.Møller M.M.T.Chakravarty J.Rudolph S.Helsen G.Radanne J.G.Siek P.Wadler O.Danvy I.Zerny R.Lämmel D.Dussart J.Hughes R.Glück K.Asai Y.Zhang M.Gasbichler S.Jagannathan S.Weeks A.K.Wright S.N.Guria A.Schlegel M.Geffken F.Aslam G.Baig M.A.Qureshi Z.A.Uzmi C.Schindelhauer E.Haußmann
Talks about:type (17) program (11) partial (8) higher (7) order (7) evalu (7) contract (6) languag (6) java (6) javascript (5)
♂ Person: Peter Thiemann
DBLP: Thiemann:Peter
Facilitated 10 volumes:
Ed
Ed
SciCoSciCo
PrCoEdSciCoSciCo
Ed
EdContributed to:
20152015
2015
20152014
2014
201320132012
20122012
20122011
20112012201020102010
20102010
2009
20092009
200820082007200620052005
20042004
200420032003200220022002200220012000
200020002000199919991998199819971997199619961996
1996
1995199519941993199319922018
1997
200320042006Wrote 67 papers:
- ECOOP-2015-KeilGSGT #javascript
- Transparent Object Proxies in JavaScript (MK, SNG, AS, MG, PT), pp. 149–173.
- ECOOP-2015-KeilT #contract #higher-order #named
- TreatJS: Higher-Order Contracts for JavaScripts (MK, PT), pp. 28–51.
- ICFP-2015-KeilT #contract #higher-order
- Blame assignment for higher-order contracts with intersection and union (MK, PT), pp. 375–386.
- LATA-2015-SulzmannT
- Derivatives for Regular Shuffle Expressions (MS, PT), pp. 275–286.
- LATA-2015-ThiemannS #automaton #regular expression
- From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.
- PLDI-2015-SiekTW
- Blame and coercion: together again for the first time (JGS, PT, PW), pp. 425–435.
- ESOP-2014-ThiemannF #type system
- Gradual Typing for Annotated Type Systems (PT, LF), pp. 47–66.
- PPDP-2014-AsaiFTZ #partial evaluation #specification
- A Type Theoretic Specification of Partial Evaluation (KA, LF, PT, YZ), pp. 57–68.
- IFL-2013-DanvyTZ #abstraction
- Circularity and λ Abstraction: From Bird to Pettorossi and back (OD, PT, IZ), p. 85.
- PEPM-2013-Thiemann
- Partially static operations (PT), pp. 75–76.
- IFL-2012-ThiemannC
- Agda Meets Accelerate (PT, MMTC), pp. 174–189.
- LCTES-2012-AslamBQUFTSH #design #embedded #java #stack
- Rethinking Java call stack design for tiny embedded devices (FA, GB, MAQ, ZAU, LF, PT, CS, EH), pp. 1–10.
- PEPM-2012-DegenTW #contract #interactive #lazy evaluation
- The interaction of contracts and laziness (MD, PT, SW), pp. 97–106.
- POPL-2012-HeideggerBT #contract #scripting language
- Access permission contracts for scripting languages (PH, AB, PT), pp. 111–122.
- ESOP-2011-BieniusaT #memory management #proving #transaction
- Proving Isolation Properties for Software Transactional Memory (AB, PT), pp. 38–56.
- TOOLS-EUROPE-2011-HeideggerT #approach #heuristic
- A Heuristic Approach for Computing Effects (PH, PT), pp. 147–162.
- TOOLS-EUROPE-J-2011-HeideggerT12 #javascript #named #testing
- JSConTest: Contract-Driven Testing and Path Effect Inference for JavaScript (PH, PT), pp. 1–29.
- ECOOP-2010-HeideggerT #scripting language
- Recency Types for Analyzing Scripting Languages (PH, PT), pp. 200–224.
- FLOPS-2010-ThiemannS #combinator #generative #polymorphism
- Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.
- PEPM-2010-RudolphT #bytecode #code generation #named #runtime #type safety
- Mnemonics: type-safe bytecode generation at run time (JR, PT), pp. 15–24.
- SAS-2010-JensenMT #analysis #interprocedural #lazy evaluation
- Interprocedural Analysis with Lazy Propagation (SHJ, AM, PT), pp. 320–339.
- TOOLS-EUROPE-2010-HeideggerT #javascript #testing
- Contract-Driven Testing of JavaScript Code (PH, PT), pp. 154–172.
- CC-2009-BieniusaT #continuation #how #monad
- How to CPS Transform a Monad (AB, PT), pp. 266–280.
- GPCE-2009-WehrT #experience #interface
- JavaGI in the battlefield: practical experience with generalized interfaces (SW, PT), pp. 65–74.
- SAS-2009-JensenMT #analysis #javascript
- Type Analysis for JavaScript (SHJ, AM, PT), pp. 238–255.
- ICALP-B-2008-NeubauerT #calculus
- Placement Inference for a Client-Server Calculus (MN, PT), pp. 75–86.
- PPDP-2008-ThiemannN #context-free grammar #metaprogramming
- Macros for context-free grammars (PT, MN), pp. 120–130.
- ECOOP-2007-DegenTW #java #linear
- Tracking Linear and Affine Resources with Java(X) (MD, PT, SW), pp. 550–574.
- ECOOP-2007-WehrLT #interface #java
- JavaGI : Generalized Interfaces for Java (SW, RL, PT), pp. 347–372.
- FLOPS-2006-Thiemann
- WASH Server Pages (PT), pp. 277–293.
- ESOP-2005-Thiemann #javascript #source code #towards #type system
- Towards a Type System for Analyzing JavaScript Programs (PT), pp. 408–422.
- POPL-2005-NeubauerT #multi #program transformation #source code
- From sequential programs to multi-tier applications by program transformation (MN, PT), pp. 221–232.
- AFP-2004-Thiemann04 #programming #web
- Server-Side Web Programming in WASH (PT), pp. 309–330.
- LDTA-2004-ThiemannN #lr #parsing
- Parameterized LR Parsing (PT, MN), pp. 115–132.
- PADL-2004-NeubauerT #implementation
- An Implementation of Session Types (MN, PT), pp. 56–70.
- ICFP-2003-NeubauerT #fault
- Discriminative sum types locate the source of type errors (MN, PT), pp. 15–26.
- SAS-2003-Thiemann #continuation #partial evaluation
- Continuation-Based Partial Evaluation without Continuations (PT), pp. 366–382.
- ESOP-2002-Thiemann #calculus #dependence #prototype
- A Prototype Dependency Calculus (PT), pp. 228–242.
- ICFP-2002-NeubauerT #higher-order #morphism #polymorphism
- Type classes with more higher-order polymorphism (MN, PT), pp. 179–190.
- PADL-2002-Thiemann #composition #named #web
- WASH/CGI: Server-Side Web Scripting with Sessions and Typed, Compositional Forms (PT), pp. 192–208.
- POPL-2002-NeubauerTGS #functional #logic
- Functional logic overloading (MN, PT, MG, MS), pp. 233–244.
- ESOP-2001-Thiemann #safety #using
- Enforcing Safety Properties Using Type Specialization (PT), pp. 62–76.
- CC-2000-Thiemann #adaptation #compilation #partial evaluation #source code
- Compiling Adaptive Programs by Partial Evaluation (PT), pp. 264–278.
- FoSSaCS-2000-Thiemann #adaptation #algebra #programming
- An Algebraic Foundation for Adaptive Programming (PT), pp. 314–328.
- PADL-2000-Thiemann #haskell #html #modelling
- Modeling HTML in Haskell (PT), pp. 263–277.
- SAIG-2000-HelsenT
- Fragmental Specialization (SH, PT), pp. 51–71.
- ESOP-1999-Thiemann #higher-order
- Higher-Order Code Splicing (PT), pp. 243–257.
- PEPM-1999-Thiemann #type system
- Interpreting Specialization in Type Theory (PT), pp. 30–43.
- ESOP-1998-Thiemann #framework
- A Generic Framework for Specialization (Abridged Version) (PT), pp. 267–281.
- POPL-1998-JagannathanTWW #alias #analysis #higher-order
- Single and Loving It: Must-Alias Analysis for Higher-Order Languages (SJ, PT, SW, AKW), pp. 329–341.
- ICFP-1997-DussartHT #imperative
- Type Specialization for Imperative Languages (DD, JH, PT), pp. 204–216.
- PLDI-1997-SperberT #compilation #partial evaluation
- Two for the Price of One: Composing Partial Evaluation and Compilation (MS, PT), pp. 215–225.
- ICFP-1996-Thiemann
- Cogen in Six Lines (PT), pp. 180–189.
- PLDI-1996-SperberT #compilation #partial evaluation
- Realistic Compilation by Partial Evaluation (MS, PT), pp. 206–214.
- PLILP-1996-Thiemann #implementation #partial evaluation
- Implementing Memoization for Partial Evaluation (PT), pp. 198–212.
- SAC-1996-SperberGT #higher-order
- Bootstrapping higher-order program transformers from interpreters (MS, RG, PT), pp. 408–413.
- FPCA-1995-Thiemann #polymorphism #revisited #type system
- Unboxed Values and Polymorphic Typing Revisited (PT), pp. 24–35.
- PEPM-1995-SperberT #lr #parsing
- The Essence of LR Parsing (MS, PT), pp. 146–155.
- PEPM-1994-Thiemann #higher-order
- Higher-Order Redundancy Elimination (PT), pp. 73–83.
- PEPM-1993-Thiemann #analysis #functional #safety #source code
- A Safety Analysis for Functional Programs (PT), pp. 133–144.
- WSA-1993-Thiemann #pattern matching #testing
- Avoiding Repeated Tests in Pattern Matching (PT), pp. 141–152.
- PLILP-1992-Thiemann #bottom-up #evaluation #functional #named #source code #tool support
- LaToKi: A Language Toolkit for Bottom-Up Evaluation of Functional Programs (PT), pp. 481–482.
- GPCE-2018-RadanneT #generative #named #regular expression
- Regenerate: a language generator for extended regular expressions (GR, PT), pp. 202–214.
- TAPSOFT-1997-Thiemann #analysis #framework
- A Unified Framework for Binding-Time Analysis (PT), pp. 742–756.
- Haskell-2003-Thiemann #xml
- XML templates and caching in WASH (PT), pp. 19–26.
- Haskell-2004-NeubauerT #haskell
- Haskell type browser (MN, PT), pp. 92–93.
- Haskell-2006-Thiemann #haskell #programming #transaction
- User-level transactional programming in Haskell (PT), pp. 84–95.