default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Garrigue
Person information
- affiliation: Nagoya University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Jacques Garrigue, Takafumi Saikawa:
Typed Compositional Quantum Computation with Lenses. ITP 2024: 15:1-15:18- 2023
- [j10]Masahiro Sato, Jacques Garrigue
:
An intuitionistic set-theoretical model of fully dependent CC. Math. Struct. Comput. Sci. 33(1): 1-32 (2023) - [i7]Jacques Garrigue, Takafumi Saikawa:
Typed compositional quantum computation with lenses. CoRR abs/2311.14347 (2023) - [i6]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
A Practical Formalization of Monadic Equational Reasoning in Dependent-type Theory. CoRR abs/2312.06103 (2023) - 2021
- [j9]Reynald Affeldt, Jacques Garrigue, David Nowak, Takafumi Saikawa:
A trustful monad for axiomatic reasoning with probability and nondeterminism. J. Funct. Program. 31: e17 (2021) - 2020
- [j8]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
A Library for Formalization of Linear Error-Correcting Codes. J. Autom. Reason. 64(6): 1123-1164 (2020) - [c21]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
Formal Adventures in Convex and Conical Spaces. CICM 2020: 23-38 - [i5]Reynald Affeldt, Jacques Garrigue, David Nowak, Takafumi Saikawa:
A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism. CoRR abs/2003.09993 (2020) - [i4]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
Formal Adventures in Convex and Conical Spaces. CoRR abs/2004.12713 (2020) - [i3]Masahiro Sato, Jacques Garrigue:
An Intuitionistic Set-theoretical Model of Fully Dependent CCω. CoRR abs/2010.12504 (2020)
2010 – 2019
- 2019
- [j7]Keigo Imai, Jacques Garrigue:
Lightweight Linearly-typed Programming with Lenses and Monads. J. Inf. Process. 27: 431-444 (2019) - [c20]Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, Kazunari Tanaka:
Proving Tree Algorithms for Succinct Data Structures. ITP 2019: 5:1-5:19 - [i2]Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, Kazunari Tanaka:
Proving tree algorithms for succinct data structures. CoRR abs/1904.02809 (2019) - 2018
- [j6]Akira Tanaka, Reynald Affeldt, Jacques Garrigue:
Safe Low-level Code Generation in Coq Using Monomorphization and Monadification. J. Inf. Process. 26: 54-72 (2018) - [c19]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
Examples of Formal Proofs about Data Compression. ISITA 2018: 633-637 - 2016
- [j5]Masahiro Sato, Jacques Garrigue:
An Intuitionistic Set-theoretical Model of CCω. J. Inf. Process. 24(4): 711-720 (2016) - [c18]Akira Tanaka, Reynald Affeldt, Jacques Garrigue:
Formal Verification of the rank Algorithm for Succinct Data Structures. ICFEM 2016: 243-260 - [c17]Reynald Affeldt, Jacques Garrigue, Takafumi Saikawa:
Formalization of Reed-Solomon codes and progress report on formalization of LDPC codes. ISITA 2016: 532-536 - [e4]Jacques Garrigue, Gabriele Keller, Eijiro Sumii:
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016. ACM 2016, ISBN 978-1-4503-4219-3 [contents] - 2015
- [j4]Jacques Garrigue:
A certified implementation of ML with structural polymorphism and recursive types. Math. Struct. Comput. Sci. 25(4): 867-891 (2015) - [c16]Reynald Affeldt, Jacques Garrigue:
Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory. ITP 2015: 17-33 - [c15]Jacques Garrigue, Jacques Le Normand:
GADTs and Exhaustiveness: Looking for the Impossible. ML Family/OCaml 2015: 23-35 - [e3]Oleg Kiselyov, Jacques Garrigue:
Proceedings ML Family/OCaml Users and Developers workshops, ML/OCaml 2014, Gothenburg, Sweden, September 4-5, 2014. EPTCS 198, 2015 [contents] - 2014
- [e2]Jacques Garrigue:
Programming Languages and Systems - 12th Asian Symposium, APLAS 2014, Singapore, November 17-19, 2014, Proceedings. Lecture Notes in Computer Science 8858, Springer 2014, ISBN 978-3-319-12735-4 [contents] - [i1]Pierre Castéran, Jacques Garrigue, David Nowak:
Summer School on Coq (NII Shonan Meeting 2014-9). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [c14]Jacques Garrigue, Didier Rémy:
Ambivalent Types for Principal Type Inference with GADTs. APLAS 2013: 257-272 - 2011
- [j3]Jacques Garrigue, Keiko Nakata:
Path resolution for nested recursive modules. High. Order Symb. Comput. 24(3): 207-237 (2011) - [c13]Hyeonseung Im, Keiko Nakata, Jacques Garrigue, Sungwoo Park:
A syntactic type system for recursive modules. OOPSLA 2011: 993-1012 - 2010
- [c12]Jacques Garrigue:
A Certified Implementation of ML with Structural Polymorphism. APLAS 2010: 360-375
2000 – 2009
- 2008
- [e1]Jacques Garrigue, Manuel V. Hermenegildo:
Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008. Proceedings. Lecture Notes in Computer Science 4989, Springer 2008, ISBN 978-3-540-78968-0 [contents] - 2006
- [c11]Jacques Garrigue:
Private Row Types: Abstracting the Unnamed. APLAS 2006: 44-60 - [c10]Keiko Nakata, Jacques Garrigue:
Recursive modules for programming. ICFP 2006: 74-86 - 2005
- [c9]Nobuaki Yoshida, Yoshio Hayashi, Yutaka Tamagaki, Shoji Urashita, Makoto Kakuta, Masahiro Watanabe, Jacques Garrigue, Reiji Nakajima:
SOBA Framework: An Application Framework for Broadband Network Environment. SAINT 2005: 296-303 - 2004
- [c8]Jacques Garrigue:
Relaxing the Value Restriction. FLOPS 2004: 196-213 - 2002
- [c7]Jacques Garrigue:
Relaxing the Value Restriction. APLAS 2002: 31-45 - 2001
- [c6]Jacques Garrigue:
Simple Type Inference for Structural Polymorphism. APLAS 2001: 329-343
1990 – 1999
- 1999
- [j2]Jacques Garrigue, Didier Rémy:
Semi-Explicit First-Class Polymorphism for ML. Inf. Comput. 155(1-2): 134-169 (1999) - 1998
- [c5]Yasuhiko Minamide, Jacques Garrigue:
On the Runtime Complexity of Type-Directed Unboxing. ICFP 1998: 1-12 - 1997
- [c4]Jacques Garrigue, Didier Rémy:
Extending ML with Semi-Explicit Higher-Order Polymorphism. TACS 1997: 20-46 - 1995
- [j1]Hassan Aït-Kaci, Jacques Garrigue:
Label-Selective lambda-Calculus Syntax and Confluence. Theor. Comput. Sci. 151(2): 353-383 (1995) - [c3]Jacques Garrigue:
The Transformation Calculus. FSTTCS 1995: 151-165 - 1994
- [c2]Jacques Garrigue, Hassan Aït-Kaci:
The Typed Polymorphic Label-Selective lambda-Calculus. POPL 1994: 35-47 - 1993
- [c1]Hassan Aït-Kaci, Jacques Garrigue:
Label-Selective lambda-Calculus Syntax and Confluence. FSTTCS 1993: 24-40
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-09-04 00:26 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:
