UB Paderborn / Katalog / Suche / in CDI

Practical type inference for arbitrary-rank types

Journal of functional programming, 2007-01, Vol.17 (1), p.1-82

2007

Volltextzugriff (PDF)

Parametricity, type equality, and higher-order polymorphism

Journal of functional programming, 2010-03, Vol.20 (2), p.175-210

2010

Volltextzugriff (PDF)

Every bit counts: The binary representation of typed data and programs

Journal of functional programming, 2012-09, Vol.22 (4-5), p.529-573

2012

Volltextzugriff (PDF)

Mechanized Metatheory for the Masses: The PoplMark Challenge

Lecture notes in computer science, 2005, p.50-65

2005

Volltextzugriff (PDF)

Efficient differentiable programming in a functional array-processing language

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

2019

Volltextzugriff (PDF)

SHErrLoc: A Static Holistic Error Locator

ACM transactions on programming languages and systems, 2017-12, Vol.39 (4), p.1-47, Article 18

2017

Volltextzugriff (PDF)

Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming

Proceedings of ACM on programming languages, 2021-08, Vol.5 (ICFP), p.1-29

2021

Volltextzugriff (PDF)

OutsideIn(X) Modular type inference with local assumptions

Journal of functional programming, 2011-09, Vol.21 (4-5), p.333-412

2011

Volltextzugriff (PDF)

A quick look at impredicativity

Proceedings of ACM on programming languages, 2020-08, Vol.4 (ICFP), p.1-29

2020

Volltextzugriff (PDF)

Gradient Forward-Propagation for Large-Scale Temporal Video Modelling

2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021, p.9245-9255

2021

Volltextzugriff (PDF)

Declarative abstractions for tensor program partitioning

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming, 2020, p.1-1

Vytiniotis, Dimitrios

2020

Volltextzugriff (PDF)

Modular, higher order cardinality analysis in theory and practice

Journal of functional programming, 2017-01, Vol.27, p.1-55, Article e11

2017

Volltextzugriff (PDF)

Refinement types for Haskell

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014, p.269-282

2014

Volltextzugriff (PDF)

HLIO: mixing static and dynamic typing for information-flow control in Haskell

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015-09, p.289-301

2015

Volltextzugriff (PDF)

Refinement types for Haskell

SIGPLAN notices, 2014-11, Vol.49 (9), p.269-282

2014

Volltextzugriff (PDF)

Project snowflake: non-blocking safe manual memory management in .NET

Proceedings of ACM on programming languages, 2017-10, Vol.1 (OOPSLA), p.1-25

2017

Volltextzugriff (PDF)

Testing noninterference, quickly

Journal of functional programming, 2016-01, Vol.26, Article e4

2016

Volltextzugriff (PDF)

A Reflection on Types

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

2016

Volltextzugriff (PDF)

Complete and decidable type inference for GADTs

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming, 2009, p.341-352

2009

Volltextzugriff (PDF)

Ziria: language for rapid prototyping of wireless PHY

Computer communication review, 2014, Vol.44 (4), p.357-358

2014

Volltextzugriff (PDF)

Guarded impredicative polymorphism

Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018, p.783-796

2018

Volltextzugriff (PDF)

Ziria: wireless programming for hardware dummies

Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing, 2014, p.1-1

Vytiniotis, Dimitrios

2014

Volltextzugriff (PDF)

Stop When You Are Almost-Full: Adventures in Constructive Termination

Interactive Theorem Proving, p.250-265

Volltextzugriff (PDF)

Diagnosing type errors with class

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015, p.12-21

2015

Volltextzugriff (PDF)

Giving Haskell a promotion

Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, 2012, p.53-66

2012

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Practical type inference for arbitrary-rank types

Parametricity, type equality, and higher-order polymorphism

Every bit counts: The binary representation of typed data and programs

Mechanized Metatheory for the Masses: The PoplMark Challenge

Efficient differentiable programming in a functional array-processing language

SHErrLoc: A Static Holistic Error Locator

Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming

OutsideIn(X) Modular type inference with local assumptions

A quick look at impredicativity

Gradient Forward-Propagation for Large-Scale Temporal Video Modelling

Declarative abstractions for tensor program partitioning

Modular, higher order cardinality analysis in theory and practice

Refinement types for Haskell

HLIO: mixing static and dynamic typing for information-flow control in Haskell

Refinement types for Haskell

Project snowflake: non-blocking safe manual memory management in .NET

Testing noninterference, quickly

A Reflection on Types

Complete and decidable type inference for GADTs

Ziria: language for rapid prototyping of wireless PHY

Guarded impredicative polymorphism

Ziria: wireless programming for hardware dummies

Stop When You Are Almost-Full: Adventures in Constructive Termination

Diagnosing type errors with class

Giving Haskell a promotion

Suchergebnisse filtern