default search action
Anton Setzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Monica Vessio, Arnold Beckmann, Matt J. Roach, Severine Saintier, Rhys Clements, Anton Setzer:
InPerpetuity{Challenging Misperceptions of the Term 'Smart Contract'}. Eur. J. Law Technol. 15(2) (2024) - [j9]Peter Dybjer, Anton Setzer:
The extended predicative Mahlo universe in Martin-Löf type theory. J. Log. Comput. 34(6): 1032-1063 (2024) - 2023
- [c30]Fahad F. Alhabardi
, Anton Setzer:
A model of Solidity-style smart contracts in the theorem prover Agda. AIBThings 2023: 1-10 - [c29]Fahad F. Alhabardi
A simulator of Solidity-style smart contracts in the theorem prover Agda. ICBTA 2023: 1-11 - 2022
- [i3]Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar, Anton Setzer:
Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control. CoRR abs/2203.03054 (2022) - 2021
- [c28]Fahad F. Alhabardi
Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control. TYPES 2021: 1:1-1:25
2010 – 2019
- 2018
- [c27]Ulrich Berger
Undecidability of Equality for Codata Types. CMCS 2018: 34-55 - [c26]Stephan Adelsberger
Formal Verification for Feature-Based Composition of Workflows. EDCC 2018: 173-181 - [c25]Stephan Adelsberger
Declarative GUIs: Simple, Consistent, and Verified. PPDP 2018: 4:1-4:15 - [c24]Stephan Adelsberger, Anton Setzer, Eric Walkingshaw:
Developing GUI Applications in a Verified Setting. SETTA 2018: 89-107 - [c23]Ulrich Berger
Martin Hofmann's Case for Non-Strictly Positive Data Types. TYPES 2018: 1:1-1:22 - [i2]Anton Setzer:
Modelling Bitcoin in Agda. CoRR abs/1804.06398 (2018) - 2017
- [j8]Andreas Abel, Stephan Adelsberger
Interactive programming in Agda - Objects and graphical user interfaces. J. Funct. Program. 27: e8 (2017) - 2016
- [j7]Karim Kanso, Anton Setzer:
A light-weight integration of automated and interactive theorem proving. Math. Struct. Comput. Sci. 26(1): 129-153 (2016) - [c22]Bashar Igried
Programming with monadic CSP-style processes in dependent type theory. TyDe@ICFP 2016: 28-38 - [c21]Bashar Igried
Defining Trace Semantics for CSP-Agda. TYPES 2016: 12:1-12:23 - [c20]Bashar Igried
Trace and Stable Failures Semantics for CSP-Agda. CoALP-Ty 2016: 36-51 - 2014
- [c19]Anton Setzer
Unnesting of Copatterns. RTA-TLCA 2014: 31-45 - 2013
- [c18]Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg
Fibred Data Types. LICS 2013: 243-252 - [c17]Andreas Abel, Brigitte Pientka, David Thibodeau, Anton Setzer
Copatterns: programming infinite structures by observations. POPL 2013: 27-38 - [c16]Phillip James, Andy Lawrence, Faron Moller
Verification of Solid State Interlocking Programs. SEFM Workshops 2013: 253-268 - 2012
- [p2]Anton Setzer:
Coalgebras as Types Determined by Their Elimination Rules. Epistemology versus Ontology 2012: 351-369 - 2011
- [c15]Thorsten Altenkirch
A Categorical Semantics for Inductive-Inductive Definitions. CALCO 2011: 70-84 - 2010
- [c14]Fredrik Nordvall Forsberg
Inductive-Inductive Definitions. CSL 2010: 454-468
2000 – 2009
- 2008
- [j6]Rose H. Abdul Rauf, Ulrich Berger
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. Theory Comput. Syst. 43(3-4): 298-321 (2008) - [c13]Karim Kanso, Faron Moller
Automated Verification of Signalling Principles in Railway Interlocking Systems. AVoCS 2008: 19-31 - 2006
- [j5]Peter Dybjer, Anton Setzer
Indexed induction-recursion. J. Log. Algebraic Methods Program. 66(1): 1-49 (2006) - [c12]Anton Setzer
Partial Recursive Functions in Martin-Löf Type Theory. CiE 2006: 505-515 - [c11]Will Harwood, Faron Moller
Weak Bisimulation Approximants. CSL 2006: 365-379 - [c10]Anton Setzer:
Object-oriented programming in dependent type theory. Trends in Functional Programming 2006: 91-108 - [c9]Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer:
Functional concepts in C++. Trends in Functional Programming 2006: 163-179 - 2005
- [p1]Peter G. Hancock, Anton Setzer:
Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory. From sets and types to topology and analysis 2005 - 2004
- [c8]Markus Michelbrink, Anton Setzer
State Dependent IO-Monads in Type Theory. CTCS 2004: 127-146 - [i1]Anton Setzer, Peter G. Hancock:
Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory (Extended Version). Dependently Typed Programming 2004 - 2003
- [j4]Peter Dybjer, Anton Setzer:
Induction-recursion and initial algebras. Ann. Pure Appl. Log. 124(1-3): 1-47 (2003) - 2002
- [c7]Anton Setzer
Java as a Functional Programming Language. TYPES 2002: 279-298 - 2001
- [c6]Peter Dybjer, Anton Setzer:
Indexed Induction-Recursion. Proof Theory in Computer Science 2001: 93-113 - 2000
- [j3]Anton Setzer
Extending Martin-Löf Type Theory by one Mahlo-universe. Arch. Math. Log. 39(3): 155-181 (2000) - [c5]Peter G. Hancock, Anton Setzer:
Interactive Programs in Dependent Type Theory. CSL 2000: 317-331
1990 – 1999
- 1999
- [j2]Gerhard Jäger, Reinhard Kahle
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. J. Symb. Log. 64(1): 53-67 (1999) - [c4]Peter Dybjer, Anton Setzer:
A Finite Axiomatization of Inductive-Recursive Definitions. TLCA 1999: 129-146 - 1998
- [j1]Anton Setzer
Well-Ordering, Proofs for Martin-Löf Type Theory. Ann. Pure Appl. Log. 92(2): 113-159 (1998) - 1997
- [c3]Anton Setzer:
Translating Set Theoretical Proofs into Type Theoretical Programs. Kurt Gödel Colloquium 1997: 278-289 - 1996
- [c2]Anton Setzer:
Inductive Definitions with Decidable Atomic Formulas. CSL 1996: 414-430 - [c1]Peter Clote, Anton Setzer:
On PHP st-connectivity, and odd charged graphs. Proof Complexity and Feasible Arithmetics 1996: 93-117
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-12-10 21:44 CET 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: