default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Allais
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Guillaume Allais
:
Scoped and Typed Staging by Evaluation. PEPM 2024: 83-93- 2023
- [c7]Jan de Muijnck-Hughes, Guillaume Allais, Edwin C. Brady:
Type Theory as a Language Workbench. Eelco Visser Commemorative Symposium 2023: 9:1-9:13 - [c6]Guillaume Allais:
Builtin Types Viewed as Inductive Families. ESOP 2023: 113-139 - [i8]Guillaume Allais:
Builtin Types viewed as Inductive Families. CoRR abs/2301.02194 (2023) - [i7]Jan de Muijnck-Hughes, Guillaume Allais, Edwin C. Brady:
Type Theory as a Language Workbench. CoRR abs/2301.12852 (2023) - [i6]Guillaume Allais, Edwin C. Brady, Nathan Corbyn, Ohad Kammar, Jeremy Yallop:
Frex: dependently-typed algebraic simplification. CoRR abs/2306.15375 (2023) - [i5]Guillaume Allais:
Scoped and Typed Staging by Evaluation. CoRR abs/2310.13413 (2023) - [i4]Guillaume Allais:
Seamless, Correct, and Generic Programming over Serialised Data. CoRR abs/2310.13441 (2023) - 2021
- [j4]Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A type- and scope-safe universe of syntaxes with binding: their semantics and proofs. J. Funct. Program. 31: e22 (2021) - [i3]Guillaume Allais:
Generic Level Polymorphic N-ary Functions. CoRR abs/2110.06107 (2021) - 2020
- [i2]Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs. CoRR abs/2001.11001 (2020)
2010 – 2019
- 2019
- [j3]Andreas Abel, Guillaume Allais, Aliya Hameer, Brigitte Pientka, Alberto Momigliano, Steven Schäfer, Kathrin Stark:
POPLMark reloaded: Mechanizing proofs by logical relations. J. Funct. Program. 29: e19 (2019) - [c5]Guillaume Allais:
Generic level polymorphic n-ary functions. TyDe@ICFP 2019: 14-26 - 2018
- [j2]Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna:
A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proc. ACM Program. Lang. 2(ICFP): 90:1-90:30 (2018) - 2017
- [c4]Guillaume Allais, James Chapman, Conor McBride, James McKinna:
Type-and-scope safe programs and their proofs. CPP 2017: 195-207 - [c3]Guillaume Allais:
Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic. TYPES 2017: 1:1-1:22 - 2014
- [j1]Yves Bertot, Guillaume Allais:
Views of PI: Definition and computation. J. Formaliz. Reason. 7(1): 105-129 (2014) - 2013
- [c2]Guillaume Allais, Conor McBride, Pierre Boutillier:
New equations for neutral terms: a sound and complete decision procedure, formalized. DTP@ICFP 2013: 13-24 - [i1]Guillaume Allais, Pierre Boutillier, Conor McBride:
New Equations for Neutral Terms: A Sound and Complete Decision Procedure, Formalized. CoRR abs/1304.0809 (2013) - 2012
- [c1]René Thiemann, Guillaume Allais, Julian Nagele:
On the Formalization of Termination Techniques based on Multiset Orderings. RTA 2012: 339-354
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 21:04 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:
