Ghent University Academic Bibliography

Show Sort by

Your filters: cql: keyword exact "Haskell"

Mark
GADTs meet their match : pattern-matching warnings that account for GADTs, guards, and laziness

Georgios Karachalias (UGent) , Tom Schrijvers (UGent) , Dimitrios Vytiniotis and Simon Peyton Jones

(2015) PROCEEDINGS OF THE 20TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING (ICFP'15) . p.424-436
Mark
Generic datatypes a la carte

Steven Keuchel (UGent) and Tom Schrijvers (UGent)

(2013) Generic Programming, 9th ACM SIGPLAN workshop, Proceedings.
Mark
Understanding idiomatic traversals backwards and forwards

Richard Bird, Jeremy Gibbons, Stefan Mehner, Janis Voigtländer and Tom Schrijvers (UGent)

(2013) ACM SIGPLAN NOTICES. 48(12). p.25-36
Mark
The implicit calculus: a new foundation for generic programming

Bruno CdS Oliveira, Tom Schrijvers (UGent) , Wontae Choi, Wonchan Lee and Kwangkeun Yi

(2012) ACM SIGPLAN NOTICES. 47(6). p.35-44
Mark
MRI: modular reasoning about interference in incremental programming

Bruno CdS Oliveira, Tom Schrijvers (UGent) and William Cook

(2012) JOURNAL OF FUNCTIONAL PROGRAMMING. 22(6). p.797-852
Mark
- dissertation
Functional programming abstractions for CP modeling

Pieter Wuille

(2011)
Mark
- conference
- C1
- open access
Parameterized models for on-line and off-line use

Pieter Wuille and Tom Schrijvers (UGent)

(2011) Lecture Notes in Computer Science. 6559. p.101-118
Mark
Monads, zippers and views: virtualizing the monad stack

Tom Schrijvers (UGent) and Bruno C de S Oliveira

(2011) ACM SIGPLAN NOTICES. 46(9). p.32-44
Mark
OUTSIDEIN(X): modular type inference with local assumptions

Dimitrios Vytiniotis, Simon Peyton Jones, Tom Schrijvers (UGent) and Martin Sulzmann

(2011) JOURNAL OF FUNCTIONAL PROGRAMMING. 21(4-5). p.333-412
Mark
- conference
- P1
- open access
Memoizing a monadic mixin DSL

Pieter Wuille, Tom Schrijvers (UGent) , Horst Samulowitz, Guido Tack and Peter Stuckey

(2011) Lecture Notes in Computer Science. 6816. p.68-85

Academic Bibliography

GADTs meet their match : pattern-matching warnings that account for GADTs, guards, and laziness

Generic datatypes a la carte

Understanding idiomatic traversals backwards and forwards

The implicit calculus: a new foundation for generic programming

MRI: modular reasoning about interference in incremental programming

Functional programming abstractions for CP modeling

Parameterized models for on-line and off-line use

Monads, zippers and views: virtualizing the monad stack

OUTSIDEIN(X): modular type inference with local assumptions

Memoizing a monadic mixin DSL

Contents

Support

Contact