default search action
Matthijs Vákár
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Tom Smeding, Matthijs Vákár:
Efficient CHAD. Proc. ACM Program. Lang. 8(POPL): 1060-1088 (2024) - [i23]Fernando Lucatelli Nunes, Matthijs Vákár:
Free Doubly-Infinitary Distributive Categories are Cartesian Closed. CoRR abs/2403.10447 (2024) - [i22]Fernando Lucatelli Nunes, Matthijs Vákár:
Monoidal closure of Grothendieck constructions via Σ-tractable monoidal structures and Dialectica formulas. CoRR abs/2405.07724 (2024) - 2023
- [j8]Fernando Lucatelli Nunes, Matthijs Vákár:
CHAD for expressive total languages. Math. Struct. Comput. Sci. 33(4-5): 311-426 (2023) - [j7]Tom Smeding, Matthijs Vákár:
Efficient Dual-Numbers Reverse AD via Well-Known Program Transformations. Proc. ACM Program. Lang. 7(POPL): 1573-1600 (2023) - [i21]Tom Smeding, Matthijs Vákár:
Efficient CHAD. CoRR abs/2307.05738 (2023) - 2022
- [j6]Mathieu Huot, Sam Staton, Matthijs Vákár:
Higher Order Automatic Differentiation of Higher Order Functions. Log. Methods Comput. Sci. 18(1) (2022) - [j5]Maria I. Gorinova, Andrew D. Gordon, Charles Sutton, Matthijs Vákár:
Conditional Independence by Typing. ACM Trans. Program. Lang. Syst. 44(1): 4:1-4:54 (2022) - [j4]Matthijs Vákár, Tom Smeding:
CHAD: Combinatory Homomorphic Automatic Differentiation. ACM Trans. Program. Lang. Syst. 44(3): 20:1-20:49 (2022) - [i20]Tom Smeding, Matthijs Vákár:
Dual-Numbers Reverse AD, Efficiently. CoRR abs/2205.11368 (2022) - [i19]Tom Smeding, Matthijs Vákár:
Efficient Dual-Numbers Reverse AD via Well-Known Program Transformations. CoRR abs/2207.03418 (2022) - [i18]Fernando Lucatelli Nunes, Matthijs Vákár:
Automatic Differentiation for ML-family languages: correctness via logical relations. CoRR abs/2210.07724 (2022) - [i17]Fernando Lucatelli Nunes, Matthijs Vákár:
Logical Relations for Partial Features and Automatic Differentiation Correctness. CoRR abs/2210.08530 (2022) - 2021
- [c6]Matthijs Vákár:
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct. ESOP 2021: 607-634 - [i16]Mathieu Huot, Sam Staton, Matthijs Vákár:
Higher Order Automatic Differentiation of Higher Order Functions. CoRR abs/2101.06757 (2021) - [i15]Matthijs Vákár:
CHAD: Combinatory Homomorphic Automatic Differentiation. CoRR abs/2103.15776 (2021) - [i14]Fernando Lucatelli Nunes, Matthijs Vákár:
CHAD for Expressive Total Languages. CoRR abs/2110.00446 (2021) - 2020
- [c5]Ryan Bernstein, Matthijs Vákár, Jeannette M. Wing:
Transforming Probabilistic Programs for Model Checking. FODS 2020: 149-159 - [c4]Mathieu Huot, Sam Staton, Matthijs Vákár:
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. FoSSaCS 2020: 319-338 - [i13]Mathieu Huot, Sam Staton, Matthijs Vákár:
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. CoRR abs/2001.02209 (2020) - [i12]Matthijs Vákár:
Denotational Correctness of Foward-Mode Automatic Differentiation for Iteration and Recursion. CoRR abs/2007.05282 (2020) - [i11]Matthijs Vákár:
Reverse AD at Higher Types: Pure, Principled and Denotationally Correct. CoRR abs/2007.05283 (2020) - [i10]Ryan Bernstein, Matthijs Vákár, Jeannette M. Wing:
Transforming Probabilistic Programs for Model Checking. CoRR abs/2008.09680 (2020) - [i9]Maria I. Gorinova, Andrew D. Gordon, Charles Sutton, Matthijs Vákár:
Conditional independence by typing. CoRR abs/2010.11887 (2020)
2010 – 2019
- 2019
- [j3]Matthijs Vákár, Ohad Kammar, Sam Staton:
A domain theory for statistical probabilistic programming. Proc. ACM Program. Lang. 3(POPL): 36:1-36:29 (2019) - 2018
- [j2]Matthijs Vákár, Radha Jagadeesan, Samson Abramsky:
Game semantics for dependent types. Inf. Comput. 261: 401-431 (2018) - [j1]Adam Scibior, Ohad Kammar, Matthijs Vákár, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean K. Moss, Chris Heunen, Zoubin Ghahramani:
Denotational validation of higher-order Bayesian inference. Proc. ACM Program. Lang. 2(POPL): 60:1-60:29 (2018) - [i8]Matthijs Vákár, Ohad Kammar, Sam Staton:
A Domain Theory for Statistical Probabilistic Programming. CoRR abs/1811.04196 (2018) - 2017
- [b1]Matthijs Vákár:
In search of effectful dependent types. University of Oxford, UK, 2017 - [c3]Neil Dhir, Matthijs Vákár, Matthew Wijers, Andrew Markham, Frank D. Wood:
Interpreting Lion Behaviour as Probabilistic Programs. UAI 2017 - [i7]Matthijs Vákár:
In Search of Effectful Dependent Types. CoRR abs/1706.07997 (2017) - [i6]Adam Scibior, Ohad Kammar, Matthijs Vákár, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean K. Moss, Chris Heunen, Zoubin Ghahramani:
Denotational validation of higher-order Bayesian inference. CoRR abs/1711.03219 (2017) - 2016
- [i5]Matthijs Vákár:
An Effectful Treatment of Dependent Types. CoRR abs/1603.04298 (2016) - 2015
- [c2]Matthijs Vákár:
A Categorical Semantics for Linear Logical Frameworks. FoSSaCS 2015: 102-116 - [c1]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. ICALP (2) 2015: 31-43 - [i4]Matthijs Vákár:
A Categorical Semantics for Linear Logical Frameworks. CoRR abs/1501.05016 (2015) - [i3]Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. CoRR abs/1508.05023 (2015) - [i2]Matthijs Vákár:
A Framework for Dependent Types and Effects. CoRR abs/1512.08009 (2015) - 2014
- [i1]Matthijs Vákár:
Syntax and Semantics of Linear Dependent Types. CoRR abs/1405.0033 (2014)
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-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint