UB Paderborn / Katalog / Suche / in CDI

Euthanasia and physician-assisted suicide: A white paper from the European Association for Palliative Care

Palliative Medicine, 2016-02, Vol.30 (2), p.104-116

2016

Volltextzugriff (PDF)

Partial Order Infinitary Term Rewriting

Logical methods in computer science, 2014-06, Vol.10, Issue 2

Bahr, Patrick

2014

Volltextzugriff (PDF)

Modal FRP for all: Functional reactive programming without space leaks in Haskell

Journal of functional programming, 2022-01, Vol.32, Article e15

BAHR, PATRICK

2022

Volltextzugriff (PDF)

Modes of Convergence for Term Graph Rewriting

Logical methods in computer science, 2012-06, Vol.8, Issue 2

Bahr, Patrick

2012

Volltextzugriff (PDF)

Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)

Electronic proceedings in theoretical computer science, 2013-02, Vol.110 (Proc. TERMGRAPH 2013), p.17-28

Bahr, Patrick

2013

Volltextzugriff (PDF)

Proceedings 11th International Workshop on Computing with Terms and Graphs: Preface

Electronic proceedings in theoretical computer science, 2021-02, Vol.334

Bahr, Patrick

2021

Volltextzugriff (PDF)

Convergence in infinitary term graph rewriting systems is simple

Mathematical structures in computer science, 2018-09, Vol.28 (8), p.1363-1414

BAHR, PATRICK

2018

Volltextzugriff (PDF)

Calculating correct compilers II: Return of the register machines

Journal of functional programming, 2020, Vol.30, Article e25

2020

Volltextzugriff (PDF)

Calculating Compilers for Concurrency

Proceedings of ACM on programming languages, 2023-08, Vol.7 (ICFP), p.740-767, Article 213

2023

Volltextzugriff (PDF)

Monadic compiler calculation (functional pearl)

Proceedings of ACM on programming languages, 2022-08, Vol.6 (ICFP), p.80-108

2022

Volltextzugriff (PDF)

Parametric Compositional Data Types

Electronic proceedings in theoretical computer science, 2012-02, Vol.76 (Proc. MSFP 2012), p.3-24

2012

Volltextzugriff (PDF)

Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain

Science of computer programming, 2017-04, Vol.137, p.63-97

2017

Volltextzugriff (PDF)

Calculating correct compilers

Journal of functional programming, 2015-01, Vol.25, Article e14

2015

Volltextzugriff (PDF)

Compiling a 50-year journey

Journal of functional programming, 2017, Vol.27, Article e20

2017

Volltextzugriff (PDF)

Asynchronous Modal FRP

Proceedings of ACM on programming languages, 2023-08, Vol.7 (ICFP), p.476-510, Article 205

2023

Volltextzugriff (PDF)

Diamonds are not forever: liveness in reactive programming with guarded recursion

Proceedings of ACM on programming languages, 2021-01, Vol.5 (POPL), p.1-28

2021

Volltextzugriff (PDF)

Proving Correctness of Compilers Using Structured Graphs

Functional and Logic Programming, p.221-237

Volltextzugriff (PDF)

The clocks are ticking: No more delays

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, p.1-12

2017

Volltextzugriff (PDF)

Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks

Proceedings of ACM on programming languages, 2019-08, Vol.3 (ICFP), p.1-27

2019

Volltextzugriff (PDF)

From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back: Invited Presentation at the 6th International Workshop on Computing with Terms and Graphs

Electronic proceedings in theoretical computer science, 2011-02, Vol.48, p.2-2

Bahr, Patrick

2011

Volltextzugriff (PDF)

Calculating Certified Compilers for Non-deterministic Languages

Mathematics of Program Construction, 2015, Vol.9129, p.159-186

2015

Volltextzugriff (PDF)

The clocks are ticking: no more delays: reduction semantics for type theory with guarded recursion

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017, p.1-12

2017

Volltextzugriff (PDF)

Asynchronous Reactive Programming with Modal Types in Haskell

Practical Aspects of Declarative Languages, 2024, Vol.14512, p.18-36

2024

Volltextzugriff (PDF)

Cutting Out Continuations

A List of Successes That Can Change the World, 2016, Vol.9600, p.187-200

2016

Volltextzugriff (PDF)

Modular Tree Automata

Mathematics of Program Construction, p.263-299

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Euthanasia and physician-assisted suicide: A white paper from the European Association for Palliative Care

Partial Order Infinitary Term Rewriting

Modal FRP for all: Functional reactive programming without space leaks in Haskell

Modes of Convergence for Term Graph Rewriting

Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)

Proceedings 11th International Workshop on Computing with Terms and Graphs: Preface

Convergence in infinitary term graph rewriting systems is simple

Calculating correct compilers II: Return of the register machines

Calculating Compilers for Concurrency

Monadic compiler calculation (functional pearl)

Parametric Compositional Data Types

Generalising tree traversals and tree transformations to DAGs: Exploiting sharing without the pain

Calculating correct compilers

Compiling a 50-year journey

Asynchronous Modal FRP

Diamonds are not forever: liveness in reactive programming with guarded recursion

Proving Correctness of Compilers Using Structured Graphs

The clocks are ticking: No more delays

Simply RaTT: a fitch-style modal calculus for reactive programming without space leaks

From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back: Invited Presentation at the 6th International Workshop on Computing with Terms and Graphs

Calculating Certified Compilers for Non-deterministic Languages

The clocks are ticking: no more delays: reduction semantics for type theory with guarded recursion

Asynchronous Reactive Programming with Modal Types in Haskell

Cutting Out Continuations

Modular Tree Automata

Suchergebnisse filtern