Travelled to:1 × Austria
1 × Czech Republic
1 × Germany
1 × Hungary
1 × The Netherlands
1 × USA
2 × Italy
Collaborated with:F.N.Forsberg A.Abel B.Pientka D.Thibodeau P.Hancock P.Dybjer ∅ W.Harwood F.Moller Stephan Adelsberger E.Walkingshaw N.Ghani L.Malatesta
Talks about:induct (4) definit (3) copattern (2) program (2) type (2) structur (1) interact (1) approxim (1) infinit (1) formula (1)
Person: Anton Setzer
DBLP: Setzer:Anton
Contributed to:
2014
2013
2013
201020062000
19991996
2018Wrote 9 papers:
- RTA-TLCA-2014-Setzer0PT #pattern matching
- Unnesting of Copatterns (AS, AA, BP, DT), pp. 31–45.
- LICS-2013-GhaniMFS #data type
- Fibred Data Types (NG, LM, FNF, AS), pp. 243–252.
- POPL-2013-AbelPTS #infinity #named #pattern matching #programming
- Copatterns: programming infinite structures by observations (AA, BP, DT, AS), pp. 27–38.
- CSL-2010-ForsbergS #induction
- Inductive-Inductive Definitions (FNF, AS), pp. 454–468.
- CSL-2006-HarwoodMS #bisimulation
- Weak Bisimulation Approximants (WH, FM, AS), pp. 365–379.
- CSL-2000-HancockS #dependent type #interactive #source code #type system
- Interactive Programs in Dependent Type Theory (PH, AS), pp. 317–331.
- TLCA-1999-DybjerS #axiom #finite #recursion
- A Finite Axiomatization of Inductive-Recursive Definitions (PD, AS), pp. 129–146.
- CSL-1996-Setzer #decidability #induction
- Inductive Definitions with Decidable Atomic Formulas (AS), pp. 414–430.
- PPDP-2018-AdelsbergerSW #consistency #declarative #user interface
- Declarative GUIs: Simple, Consistent, and Verified (SA, AS, EW), p. 15.