default search action
Patrik Jansson
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Julia Jansson
, Patrik Jansson
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials. J. Funct. Program. 33 (2023) - [i4]Julia Jansson
Level-p-complexity of Boolean functions using Thinning, Memoization, and Polynomials. CoRR abs/2302.02473 (2023) - [i3]Nicola Botta, Patrik Jansson, Guilherme Horta Alvares Da Silva:
Types, equations, dimensions and the Pi theorem. CoRR abs/2308.09481 (2023) - [i2]Jean-Philippe Bernardy, Patrik Jansson:
Domain-Specific Tensor Languages. CoRR abs/2312.02664 (2023) - 2021
- [j10]Nicola Botta
Extensional equality preservation and verified generic programming. J. Funct. Program. 31: e24 (2021) - 2020
- [i1]Nicola Botta, Nuria Brede, Patrik Jansson, Tim Richter:
Extensional equality preservation and verified generic programming. CoRR abs/2008.02123 (2020)
2010 – 2019
- 2018
- [c27]Cezar Ionescu
Type Theory as a Framework for Modelling and Programming. ISoLA (1) 2018: 119-133 - [c26]Maximilian Algehed
Saint: An API-Generic Type-Safe Interpreter. TFP 2018: 94-113 - [c25]Patrik Jansson, Sólrún Halla Einarsdóttir, Cezar Ionescu:
Examples and Results from a BSc-level Course on Domain Specific Languages of Mathematics. TFPIE@TFP 2018: 79-90 - 2017
- [j9]Nicola Botta, Patrik Jansson, Cezar Ionescu, David R. Christiansen, Edwin C. Brady
Sequential decision problems, dependent types and generic solutions. Log. Methods Comput. Sci. 13(1) (2017) - [j8]Nicola Botta, Patrik Jansson
Contributions to a computational theory of policy advice and avoidability. J. Funct. Program. 27: e23 (2017) - [c24]Maximilian Algehed, Patrik Jansson
VisPar: visualising dataflow graphs from the Par Monad. FHPC@ICFP 2017: 24-29 - 2016
- [j7]Jean-Philippe Bernardy, Patrik Jansson
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda. Log. Methods Comput. Sci. 12(2) (2016) - [c23]Adam Sandberg Eriksson, Patrik Jansson
An agda formalisation of the transitive closure of block matrices (extended abstract). TyDe@ICFP 2016: 60-61 - [c22]Cezar Ionescu, Patrik Jansson
Domain-Specific Languages of Mathematics: Presenting Mathematical Analysis Using Functional Programming. TFPIE 2016: 1-15 - 2012
- [j6]Jean-Philippe Bernardy, Patrik Jansson
Proofs for free - Parametricity for dependent types. J. Funct. Program. 22(2): 107-152 (2012) - [c21]Johan Jeuring, Patrik Jansson
Testing type class laws. Haskell 2012: 49-60 - [c20]Jonas Duregård, Patrik Jansson
Feat: functional enumeration of algebraic types. Haskell 2012: 61-72 - [c19]Cezar Ionescu, Patrik Jansson
Dependently-Typed Programming in Scientific Computing - Examples from Economic Modelling. IFL 2012: 140-156 - 2011
- [c18]Cláudio Amaral, Mário Florido
Interfacing dynamically typed languages and the why tool: reasoning about lists and tuples. Erlang Workshop 2011: 92-93 - [c17]Jonas Duregård, Patrik Jansson
Embedded parser generators. Haskell 2011: 107-117 - [c16]Cezar Ionescu, Patrik Jansson
Testing versus proving in climate impact research. TYPES 2011: 41-54 - 2010
- [j5]Jean-Philippe Bernardy, Patrik Jansson
Generic programming with C++ concepts and Haskell type classes - a comparison. J. Funct. Program. 20(3-4): 271-302 (2010) - [c15]Jean-Philippe Bernardy, Patrik Jansson
Testing Polymorphic Properties. ESOP 2010: 125-144 - [c14]Jean-Philippe Bernardy, Patrik Jansson
Parametricity and dependent types. ICFP 2010: 345-356
2000 – 2009
- 2009
- [j4]Shin-Cheng Mu
Algebra of programming in Agda: Dependent types for relational program derivation. J. Funct. Program. 19(5): 545-579 (2009) - [c13]Daniel Lincke, Patrik Jansson
Generic Libraries in C++ with Concepts from High-Level Domain Descriptions in Haskell. DSL 2009: 236-261 - [e1]Patrik Jansson, Sibylle Schupp:
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming, WGP@ICFP 2009, Edinburgh, United Kingdom, August 31 - September 2, 2009. ACM 2009, ISBN 978-1-60558-510-9 [contents] - 2008
- [c12]Alexey Rodriguez, Johan Jeuring, Patrik Jansson
Comparing libraries for generic programming in haskell. Haskell 2008: 111-122 - [c11]Jean-Philippe Bernardy, Patrik Jansson
A comparison of c++ concepts and haskell type classes. ICFP-WGP 2008: 37-48 - [c10]Shin-Cheng Mu
Algebra of Programming Using Dependent Types. MPC 2008: 268-283 - 2006
- [c9]Patrik Jansson
Testing Properties of Generic Functions. IFL 2006: 217-234 - [c8]Nils Anders Danielsson, John Hughes, Patrik Jansson
Fast and loose reasoning is morally correct. POPL 2006: 206-217 - 2004
- [c7]Nils Anders Danielsson, Patrik Jansson
Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values. MPC 2004: 85-109 - [c6]Ulf Norell, Patrik Jansson
Prototyping Generic Programming in Template Haskell. MPC 2004: 314-333 - 2003
- [j3]Marcin Benke, Peter Dybjer, Patrik Jansson:
Universes for Generic Programs and Proofs in Dependent Type Theory. Nord. J. Comput. 10(4): 265-289 (2003) - [c5]Ulf Norell, Patrik Jansson
Polytypic Programming in Haskell. IFL 2003: 168-184 - 2002
- [j2]Patrik Jansson
Polytypic data conversion programs. Sci. Comput. Program. 43(1): 35-75 (2002) - 2000
- [b1]Patrik Jansson:
Functional Polytypic Programming. Chalmers University of Technology, Gothenburg, Sweden, 2000
1990 – 1999
- 1999
- [c4]Patrik Jansson
Polytypic Compact Printing and Parsing. ESOP 1999: 273-287 - 1998
- [j1]Patrik Jansson
Polytypic Unification. J. Funct. Program. 8(5): 527-536 (1998) - [c3]Roland Carl Backhouse, Patrik Jansson
Generic Programming: An Introduction. Advanced Functional Programming 1998: 28-115 - 1997
- [c2]Patrik Jansson
Polyp - A Polytypic Programming Language. POPL 1997: 470-482 - 1996
- [c1]Johan Jeuring, Patrik Jansson
Polytypic Programming. Advanced Functional Programming 1996: 68-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: