default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Spiwack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Arnaud Spiwack
, Csongor Kiss, Jean-Philippe Bernardy, Nicolas Wu, Richard A. Eisenberg:
Linearly qualified types: generic inference for capabilities and uniqueness. Proc. ACM Program. Lang. 6(ICFP): 137-164 (2022)- 2021
- [c8]Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack:
Union and intersection contracts are hard, actually. DLS 2021: 1-11 - [c7]Jean-Philippe Bernardy, Arnaud Spiwack:
Evaluating linear functions to symmetric monoidal categories. Haskell 2021: 14-26 - [i11]Jean-Philippe Bernardy, Richard A. Eisenberg, Csongor Kiss, Arnaud Spiwack, Nicolas Wu:
Linear Constraints. CoRR abs/2103.06127 (2021) - [i10]Jean-Philippe Bernardy, Arnaud Spiwack:
Evaluating Linear Functions to Symmetric Monoidal Categories. CoRR abs/2103.06195 (2021) - [i9]Teodoro Freund, Yann Hamdaoui, Arnaud Spiwack:
Union and intersection contracts are hard, actually. CoRR abs/2106.06278 (2021)
2010 – 2019
- 2018
- [j4]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. Proc. ACM Program. Lang. 2(POPL): 5:1-5:29 (2018) - [i8]Arnaud Spiwack:
Circuits via topoi. CoRR abs/1807.07159 (2018) - 2017
- [i7]Jean-Philippe Bernardy, Mathieu Boespflug, Ryan R. Newton, Simon Peyton Jones, Arnaud Spiwack:
Linear Haskell: practical linearity in a higher-order polymorphic language. CoRR abs/1710.09756 (2017) - 2015
- [i6]Arnaud Spiwack:
Notes on axiomatising Hurkens's Paradox. CoRR abs/1507.04577 (2015) - [i5]Arnaud Spiwack:
The tree machine. CoRR abs/1507.04589 (2015) - 2014
- [c6]Guyslain Naves, Arnaud Spiwack:
Balancing Lists: A Proof Pearl. ITP 2014: 437-449 - [i4]Guyslain Naves, Arnaud Spiwack:
Balancing lists: a proof pearl. CoRR abs/1401.7886 (2014) - 2013
- [c5]Hugo Herbelin, Arnaud Spiwack:
The Rooster and the Syntactic Bracket. TYPES 2013: 169-187 - [i3]Hugo Herbelin, Arnaud Spiwack:
The Rooster and the Syntactic Bracket. CoRR abs/1309.5767 (2013) - [i2]Arnaud Spiwack:
Abstract interpretation as anti-refinement. CoRR abs/1310.4283 (2013) - 2011
- [b1]Arnaud Spiwack:
Verified Computing in Homological Algebra. (Calculs vérifiés en algèbre homologique). École Polytechnique, Palaiseau, France, 2011 - 2010
- [c4]Michaël Armand, Benjamin Grégoire, Arnaud Spiwack, Laurent Théry:
Extending Coq with Imperative Features and Its Application to SAT Verification. ITP 2010: 83-98
2000 – 2009
- 2008
- [j3]Luigi Liquori, Arnaud Spiwack:
Extending FeatherTrait Java with Interfaces. Theor. Comput. Sci. 398(1-3): 243-260 (2008) - [j2]Luigi Liquori, Arnaud Spiwack:
FeatherTrait: A modest extension of Featherweight Java. ACM Trans. Program. Lang. Syst. 30(2): 11:1-11:32 (2008) - [c3]David Teller, Arnaud Spiwack, Till Varoquaux:
Catch Me If You Can - Looking for Type-Safe, Hierarchical, Lightweight, Polymorphic and Efficient Error Management in OCaml. IFL 2008: 249-271 - 2007
- [j1]Thierry Coquand, Arnaud Spiwack:
A proof of strong normalisation using domain theory. Log. Methods Comput. Sci. 3(4) (2007) - [c2]Thierry Coquand, Arnaud Spiwack:
Towards Constructive Homological Algebra in Type Theory. Calculemus/MKM 2007: 40-54 - [i1]Thierry Coquand, Arnaud Spiwack:
A proof of strong normalisation using domain theory. CoRR abs/0709.1401 (2007) - 2006
- [c1]Thierry Coquand, Arnaud Spiwack:
A Proof of Strong Normalisation using Domain Theory. LICS 2006: 307-316
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-04-25 05:54 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:
