Tom Schrijvers

Affiliations:
  • Catholic University of Leuven, Belgium


According to our database1, Tom Schrijvers authored at least 140 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Forward- or reverse-mode automatic differentiation: What's the difference?
Sci. Comput. Program., January, 2024

2023
From High to Low: Simulating Nondeterminism and State with State.
CoRR, 2023

Automatic Differentiation in Prolog.
CoRR, 2023

A Calculus for Scoped Effects & Handlers.
CoRR, 2023

A Framework for Higher-Order Effects & Handlers.
CoRR, 2023

sf Fluo: A Domain-Specific Language for Experiments in Fluorescence Microscopy (Application Paper).
Proceedings of the Practical Aspects of Declarative Languages, 2023

No Unification Variable Left Behind: Fully Grounding Type Inference for the HDM System.
Proceedings of the 14th International Conference on Interactive Theorem Proving, 2023

eTeacher: A Pilot in Flemish Secondary Education.
Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 2, 2023

Phases in Software Architecture.
Proceedings of the 1st ACM SIGPLAN International Workshop on Functional Software Architecture, 2023

2022
Fusing industry and academia at GitHub (experience report).
Proc. ACM Program. Lang., 2022

Structured Handling of Scoped Effects: Extended Version.
CoRR, 2022

Breadth-First Traversal via Staging.
Proceedings of the Mathematics of Program Construction - 14th International Conference, 2022

Oregano: staging regular expressions with Moore Cayley fusion.
Proceedings of the Haskell '22: 15th ACM SIGPLAN International Haskell Symposium, Ljubljana, Slovenia, September 15, 2022

A Functional Account of Probabilistic Programming with Possible Worlds - Declarative Pearl.
Proceedings of the Functional and Logic Programming - 16th International Symposium, 2022

Structured Handling of Scoped Effects.
Proceedings of the Programming Languages and Systems, 2022

2021
Algorithmics.
Proceedings of the Advancing Research in Information and Communication Technology, 2021

Efficient compilation of algebraic effect handlers.
Proc. ACM Program. Lang., 2021

Special Issue on Probabilistic Logic Programming (PLP 2018).
Int. J. Approx. Reason., 2021

Latent Effects for Reusable Language Components: Extended Version.
CoRR, 2021

Disjunctive Delimited Control.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2021

Divide et Impera: Efficient Synthesis of Cyber-Physical System Architectures from Formal Contracts.
Proceedings of the Formal Methods - 24th International Symposium, 2021

Latent Effects for Reusable Language Components.
Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020
Consistent Subtyping for All.
ACM Trans. Program. Lang. Syst., 2020

PλωNK: functional probabilistic NetKAT.
Proc. ACM Program. Lang., 2020

Resolution as intersection subtyping via Modus Ponens.
Proc. ACM Program. Lang., 2020

Faster coroutine pipelines: A reconstruction.
J. Funct. Program., 2020

Generalized monoidal effects and handlers.
J. Funct. Program., 2020

Explicit effect subtyping.
J. Funct. Program., 2020

State Will do.
Proceedings of the Trends in Functional Programming - 21st International Symposium, 2020

PaSe: An Extensible and Inspectable DSL for Micro-Animations.
Proceedings of the Trends in Functional Programming - 21st International Symposium, 2020

Row and Bounded Polymorphism via Disjoint Polymorphism.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
Implicit quantification made explicit: How to interpret blank nodes and universal variables in Notation3 Logic.
J. Web Semant., 2019

A mechanical formalization of higher-ranked polymorphic type inference.
Proc. ACM Program. Lang., 2019

Coherence of type class resolution.
Proc. ACM Program. Lang., 2019

COCHIS: Stable and coherent implicits.
J. Funct. Program., 2019

Lazy Stream Programming in Prolog.
Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

Bidirectional Type Class Instances (Extended Version).
CoRR, 2019

Handling Local State with Global State.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

CONDEnSe: Contract Based Design Synthesis.
Proceedings of the 22nd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems, 2019

Monad transformers and modular algebraic effects: what binds them together.
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019

Bidirectional type class instances.
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019

Distributive Disjoint Polymorphism for Compositional Programming.
Proceedings of the Programming Languages and Systems, 2019

2018
A unified view of monadic and applicative non-determinism.
Sci. Comput. Program., 2018

The Essence of Nested Composition (Artifact).
Dagstuhl Artifacts Ser., 2018

Algebraic Effect Handlers go Mainstream (Dagstuhl Seminar 18172).
Dagstuhl Reports, 2018

Syntax and Semantics for Operations with Scopes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Formalization of a Polymorphic Subtyping Algorithm.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Explicit Effect Subtyping.
Proceedings of the Programming Languages and Systems, 2018

The Essence of Nested Composition.
Proceedings of the 32nd European Conference on Object-Oriented Programming, 2018

2017
From PRISM to ProbLog and Back Again.
Proceedings of the Workshop on Probabilistic Logic Programming 2017 co-located with 27th International Conference on Inductive Logic Programming (ILP 2017), 2017

Handlers for Non-Monadic Computations.
Proceedings of the 29th Symposium on Implementation and Application of Functional Programming Languages, 2017

Elaboration on functional dependencies: functional dependencies are dead, long live functional dependencies!
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

Quantified class constraints.
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

2016
Tabling with Sound Answer Subsumption.
Theory Pract. Log. Program., 2016

Efficient algebraic effect handlers for Prolog.
Theory Pract. Log. Program., 2016

From MinX to MinC: semantics-driven decompilation of recursive datatypes.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Tabling as a Library with Delimited Control.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Proof Relevant Corecursive Resolution.
Proceedings of the Functional and Logic Programming - 13th International Symposium, 2016

Needle & Knot: Binder Boilerplate Tied Up.
Proceedings of the Programming Languages and Systems, 2016

2015
Tabling as a library with delimited control.
Theory Pract. Log. Program., 2015

Preface for SCP special issue on Principles and Practice of Declarative Programming.
Sci. Comput. Program., 2015

Reasoning about modular datatypes with Mendler induction.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

The Future of Programming is Functional.
Proceedings of the Sixth International Symposium on Information and Communication Technology, 2015

From monoids to near-semirings: the essence of MonadPlus and alternative.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

Fusion for Free - Efficient Algebraic Effect Handlers.
Proceedings of the Mathematics of Program Construction - 12th International Conference, 2015

Fixing non-determinism.
Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, 2015

GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2014
Introduction to the 30th International Conference on Logic Programming Special Issue.
Theory Pract. Log. Program., 2014

Tor: Modular search with hookable disjunction.
Sci. Comput. Program., 2014

Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Partial Type Signatures for Haskell.
Proceedings of the Practical Aspects of Declarative Languages, 2014

Effect handlers in scope.
Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

Compositional reasoning about aspect interference.
Proceedings of the 13th International Conference on Modularity, 2014

2013
Delimited continuations for prolog.
Theory Pract. Log. Program., 2013

Integrating Datalog and Constraint Solving.
CoRR, 2013

Search combinators.
Constraints An Int. J., 2013

Meta-theory à la carte.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Generic datatypes à la carte.
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming, 2013

Modular monadic meta-theory.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Understanding idiomatic traversals backwards and forwards.
Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

Automated Design of Search with Composability.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
SWI-Prolog.
Theory Pract. Log. Program., 2012

MRI: Modular reasoning about interference in incremental programming.
J. Funct. Program., 2012

Extended Report: The Implicit Calculus
CoRR, 2012

Tor: extensible search with hookable disjunction.
Proceedings of the Principles and Practice of Declarative Programming, 2012

The implicit calculus: a new foundation for generic programming.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation.
Proceedings of the Practical Aspects of Declarative Languages, 2012

An Introduction to Search Combinators.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

2011
OutsideIn(X) Modular type inference with local assumptions.
J. Funct. Program., 2011

Approximating Constraint Propagation in Datalog
CoRR, 2011

Memoizing a Monadic Mixin DSL.
Proceedings of the Functional and Constraint Logic Programming, 2011

Monads, zippers and views: virtualizing the monad stack.
Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

2010
As time goes by: Constraint Handling Rules.
Theory Pract. Log. Program., 2010

Parameterized Models for On-Line and Off-Line Use.
Proceedings of the Functional and Constraint Logic Programming, 2010

Let should not be generalized.
Proceedings of TLDI 2010: 2010 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2010

Strictness Meets Data Flow.
Proceedings of the Static Analysis - 17th International Symposium, 2010

Haskell Type Constraints Unleashed.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

EffectiveAdvice: disciplined advice with explicit effects.
Proceedings of the 9th International Conference on Aspect-Oriented Software Development, 2010

2009
The computational power and complexity of constraint handling rules.
ACM Trans. Program. Lang. Syst., 2009

Monadic constraint programming.
J. Funct. Program., 2009

As time goes by: Constraint Handling Rules - A survey of CHR research from 1998 to 2007
CoRR, 2009

Type invariants for Haskell.
Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, 2009

A Transformational Approach for Proving Properties of the CHR Constraint Store.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2009

Towards a Framework for Constraint-Based Test Case Generation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2009

Attributed Data for CHR Indexing.
Proceedings of the Logic Programming, 25th International Conference, 2009

Complete and decidable type inference for GADTs.
Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

2008
CHR for Imperative Host Languages.
Proceedings of the Constraint Handling Rules, 2008

Guard Reasoning in the Refined Operational Semantics of CHR.
Proceedings of the Constraint Handling Rules, 2008

A Flexible Search Framework for CHR.
Proceedings of the Constraint Handling Rules, 2008

Improving Prolog programs: Refactoring for Prolog.
Theory Pract. Log. Program., 2008

TCHR: a framework for tabled CLP.
Theory Pract. Log. Program., 2008

Confluence for Functional Dependencies.
Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

From Monomorphic to Polymorphic Well-Typings and Beyond.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Automatic Generation of Test Inputs for Mercury.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Transactions in Constraint Handling Rules.
Proceedings of the Logic Programming, 24th International Conference, 2008

Uniting the Prolog Community.
Proceedings of the Logic Programming, 24th International Conference, 2008

Towards Typed Prolog.
Proceedings of the Logic Programming, 24th International Conference, 2008

Constraint Handling Rules.
Proceedings of the Logic Programming, 24th International Conference, 2008

Type checking with open type functions.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
User-definable rule priorities for CHR.
Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

Aggregates in Constraint Handling Rules.
Proceedings of the Logic Programming, 23rd International Conference, 2007

The Correspondence Between the Logical Algorithms Language and CHR.
Proceedings of the Logic Programming, 23rd International Conference, 2007

2006
Optimal union-find in Constraint Handling Rules.
Theory Pract. Log. Program., 2006

Improving PARMA trailing.
Theory Pract. Log. Program., 2006

Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR.
Proceedings of the 20th Workshop on Logic Programming, 2006

INCLP(R) - Interval-based Nonlinear Constraint Logic Programming over the Reals.
Proceedings of the 20th Workshop on Logic Programming, 2006

Polymorphic algebraic data type reconstruction.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Memory Reuse for CHR.
Proceedings of the Logic Programming, 22nd International Conference, 2006

Principal Type Inference for GHC-Style Multi-parameter Type Classes.
Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

2005
Automatic Implication Checking for CHR Constraints.
Proceedings of the 6th International Workshop on Rule-Based Programming, 2005

Guard Simplification in CHR programs.
Proceedings of the 19th Workshop on (Constraint) Logic Programming, 2005

Analysing the CHR Implementation of Union-Find.
Proceedings of the 19th Workshop on (Constraint) Logic Programming, 2005

Abstract interpretation for constraint handling rules.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Guard and Continuation Optimization for Occurrence Representations of CHR.
Proceedings of the Logic Programming, 21st International Conference, 2005

Analyses, Optimizations and Extensions of Constraint Handling Rules: Ph.D. Summary.
Proceedings of the Logic Programming, 21st International Conference, 2005

2004
Constraint Handling Rules and Tabled Execution.
Proceedings of the Logic Programming, 20th International Conference, 2004

Improving Prolog Programs: Refactoring for Prolog.
Proceedings of the Logic Programming, 20th International Conference, 2004

JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR.
Proceedings of the Logic Programming, 20th International Conference, 2004

2002
Combining an improvement to PARMA trailing with trailing analysis.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Trailing Analysis for HAL.
Proceedings of the Logic Programming, 18th International Conference, 2002


  Loading...