default search action
Ana Bove
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j3]Ana Bove
, Alexander Krauss, Matthieu Sozeau:
Partiality and recursion in interactive theorem provers - an overview. Math. Struct. Comput. Sci. 26(1): 38-88 (2016) - 2015
- [c14]Ernesto Copello, Alvaro Tasistro
Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory. LSFA 2015: 109-124 - 2012
- [c13]Ana Bove
Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs. FoSSaCS 2012: 104-118 - [e3]Ekaterina Komendantskaya, Ana Bove, Milad Niqui:
Partiality and Recursion in Interactive Theorem Provers, PAR@ITP 2010, Edinburgh, UK, July 15, 2010. EPiC Series 5, EasyChair 2012 [contents] - 2010
- [e2]Ana Bove
Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, PAR 2010, Edinburgh, UK, 15th July 2010. EPTCS 43, 2010 [contents]
2000 – 2009
- 2009
- [c12]Ana Bove
Embedding a logical theory of constructions in Agda. PLPV 2009: 59-66 - [c11]Ana Bove
A Brief Overview of Agda - A Functional Language with Dependent Types. TPHOLs 2009: 73-78 - [c10]Ana Bove
Another Look at Function Domains. MFPS 2009: 61-74 - [e1]Ana Bove
Language Engineering and Rigorous Software Development, International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24 - March 1, 2008, Revised Tutorial Lectures. Lecture Notes in Computer Science 5520, Springer 2009, ISBN 978-3-642-03152-6 [contents] - 2008
- [c9]Ana Bove
Dependent Types at Work. LerNet ALFA Summer School 2008: 57-99 - [c8]Ana Bove
A Type of Partial Recursive Functions. TPHOLs 2008: 102-117 - 2007
- [c7]Ana Bove
Computation by Prophecy. TLCA 2007: 70-83 - 2005
- [j2]Ana Bove
Modelling general recursion in type theory. Math. Struct. Comput. Sci. 15(4): 671-708 (2005) - [c6]Andreas Abel, Marcin Benke, Ana Bove
Verifying haskell programs using constructive type theory. Haskell 2005: 62-73 - [c5]Ana Bove
Recursive Functions with Higher Order Domains. TLCA 2005: 116-130 - 2004
- [c4]Ana Bove
Formalising Bitonic Sort in Type Theory. TYPES 2004: 82-97 - 2002
- [b1]Ana Bove:
General Recursion in Type Theory. Chalmers University of Technology, Gothenburg, Sweden, 2002 - [c3]Ana Bove
General Recursion in Type Theory. TYPES 2002: 39-58 - 2001
- [j1]Ana Bove:
Simple General Recursion in Type Theory. Nord. J. Comput. 8(1): 22-42 (2001) - [c2]Ana Bove
Nested General Recursion and Partiality in Type Theory. TPHOLs 2001: 121-135
1990 – 1999
- 1992
- [c1]Ana Bove, Laura Arbilla:
A Confluent Calculus of Macro Expansion and Evaluation. LISP and Functional Programming 1992: 278-287
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-24 22:45 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: