Travelled to:1 × Austria
1 × Brazil
1 × Canada
1 × Chile
1 × France
1 × Germany
1 × Norway
1 × Serbia
1 × Taiwan
1 × United Kingdom
3 × Japan
Collaborated with:J.Ketema ∅ D.d.Carvalho S.Hedegaard S.B.Andersen A.Schnabl C.Kop C.Appel V.v.Oostrom C.Lioma B.Larsen N.D.Hansen K.Hornbæk S.S.Sander J.A.Bargas-Avila N.B.B.Grathwohl J.D.Pallesen
Talks about:rewrit (8) term (5) system (4) non (4) infinitari (3) complex (3) character (2) implicit (2) calculus (2) modular (2)
Person: Jakob Grue Simonsen
DBLP: Simonsen:Jakob_Grue
Contributed to:
2015
2014
20142013
20122012
20112011
20102010200920052004
2017Wrote 15 papers:
- SIGIR-2015-LiomaSLH #dependence #information retrieval
- Non-Compositional Term Dependence for Information Retrieval (CL, JGS, BL, NDH), pp. 595–604.
- CHI-2014-HornbaekSBS #human-computer #interactive
- Is once enough?: on the extent and content of replications in human-computer interaction (KH, SSS, JABA, JGS), pp. 3523–3532.
- RTA-TLCA-2014-CarvalhoS #decidability #polynomial #set
- An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
- CHI-2013-HedegaardS #experience #online #usability #user interface
- Extracting usability and user experience information from online user reviews (SH, JGS), pp. 2089–2098.
- DLT-2012-KetemaS #normalisation #string #termination
- Characterizing Languages by Normalization and Termination in String Rewriting — (JK, JGS), pp. 459–464.
- RTA-2012-AndersenS #term rewriting
- Term Rewriting Systems as Topological Dynamical Systems (SBA, JGS), pp. 53–68.
- CSL-2011-SchnablS #complexity #runtime
- The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.
- RTA-2011-GrathwohlKPS #graph #named #reduction #term rewriting #visualisation #λ-calculus
- Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
- FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
- RTA-2010-AppelOS #composition #higher-order
- Higher-Order (Non-)Modularity (CA, VvO, JGS), pp. 17–32.
- RTA-2010-Simonsen #convergence #normalisation
- Weak Convergence and Uniform Normalization in Infinitary Rewriting (JGS), pp. 311–324.
- RTA-2009-Simonsen #term rewriting
- The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (JGS), pp. 335–349.
- RTA-2005-KetemaS #combinator #reduction
- Infinitary Combinatory Reduction Systems (JK, JGS), pp. 438–452.
- RTA-2004-Simonsen #composition #confluence #on the #term rewriting
- On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
- ESOP-2017-KopS #complexity #higher-order #nondeterminism #power of #programming #using
- The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming (CK, JGS), pp. 668–695.