Andreas Abel
2006
A Polymorphic Lambda-Calculus with Sized Higher-Order Types
Ludwig-Maximilians-Universität München
http://www2.tcs.ifi.lmu.de/~ abel/publications.html
Andreas Abel
2016
Compositional Coinduction with Sized Types
Ichiro Hasuo
Coalgebraic Methods in Computer Science
Springer
5–10
http://dx.doi.org/10.1007/978-3-319-40370-0_2
Andreas Abel
Stephan Adelsberger
Anton Setzer
2016
ooAgda. Agda library
https://github.com/agda/ooAgda
Andreas Abel
Stephan Adelsberger
Anton Setzer
2017
Interactive programming in Agda – Objects and graphical user interfaces
Journal of Functional Programming
27
10.1017/S0956796816000319
Andreas Abel
Brigitte Pientka
David Thibodeau
Anton Setzer
2013
Copatterns: Programming infinite structures by observations
Roberto Giacobazzi
Radhia Cousot
Proceedings of POPL'13
ACM
27–38
10.1145/2429069.2429075
Agda Community
2017
Literal Agda
http://agda.readthedocs.io/en/latest/tools/literate-programming.html
Stephen D Brookes
AW Roscoe
1984
An improved failures model for communicating processes
International Conference on Concurrency
Springer
281–305
10.1007/3-540-15670-4_14
https://link.springer.com/chapter/10.1007/3-540-15670-4_14
Neil C. C. Brown
2008
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
The thirty-first Communicating Process Architectures Conference, CPA 2008
67–83
10.3233/978-1-58603-907-3-67
Peter Dybjer
1991
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
Gérard Huet
Gordon Plotkin
Logical Frameworks
Cambridge University Press
280 – 306
10.1017/CBO9780511569807.012
Peter Dybjer
1992
Universes and a General Notion of Simultaneous Inductive-Recursive Definition in Type Theory
http://www.lfcs.inf.ed.ac.uk/research/types-bra/proc/proc92.ps.gz
In Bengt Nordström, Kent Petersson & Gordon Plotkin, editors : Proceedings of the 1992 workshop on types for proofs and programs, Båstad, pp. 106 – 114
Peter Dybjer
2000
A general formulation of simultaneous inductive-recursive definitions in type theory
Journal of Symbolic Logic
65
2
525 – 549
10.2307/2586554
Peter Dybjer
Anton Setzer
2003
Induction-Recursion and Initial Algebras
Annals of Pure and Applied Logic
124
1 – 47
10.1016/S0168-0072(02)00096-9
ERTMS
2013
The European Rail Traffic Mangement System
http://www.ertms.net/
P. Hancock
A. Setzer
1999
The IO monad in dependent type theory
http://www.md.chalmers.se/Cs/Research/Semantics /APPSEM/dtp99.html
In: Electronic proceedings of the workshop on dependent types in programming, Göteborg, 27-28 March 1999, pp. 1 – 13.
Peter Hancock
Anton Setzer
2000
Interactive programs in dependent type theory
P. Clote
H. Schwichtenberg
Computer Science Logic
LNCS, Vol. 1862
317 – 331
10.1007/3-540-44622-2_21
Peter Hancock
Anton Setzer
2000
Specifying interactions with dependent types
http://www-sop.inria.fr/oasis/DTP00/Proceedings/proceedings.html
In: Workshop on subtyping and dependent types in programming, Portugal,7 July 2000, electronic proceedings, pp. 1 – 13.
C. A. R. Hoare
1978
Communicating Sequential Processes
Commun. ACM
21
8
666–677
10.1145/359576.359585
Bashar Igried
Anton Setzer
2016
CSP-Agda. Agda-library
https://github.com/csetzer/cspagdaPublic
\voidb@x
Bashar Igried
Anton Setzer
2016
Programming with Monadic CSP-style Processes in Dependent Type Theory
Proceedings of the 1st International Workshop on Type-Driven Development
TyDe 2016
ACM
New York, NY, USA
28–38
10.1145/2976022.2976032
Yoshinao Isobe
Markus Roggenbach
2005
A generic theorem prover of CSP refinement
International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Springer
108–123
10.1007/978-3-540-31980-1_8
https://link.springer.com/chapter/10.1007/978-3-540-31980-1_8
Karim Kanso
2012
Agda as a Platform for the Development of Verified Railway Interlocking Systems
Dept. of Computer Science
Swansea University, Swansea, UK
http://www.swan.ac.uk/csetzer/articlesFromOthers/index.html
Karim Kanso
Anton Setzer
2014
A light-weight integration of automated and interactive theorem proving
Mathematical Structures in Computer Science
FirstView
1–25
10.1017/S0960129514000140
http://journals.cambridge.org/article_S0960129514000140
Per Martin-Löf
1984
Intuitionistic type theory
Bibliopolis
Naples
Eugenio Moggi
1991
Notions of computation and monads
Information and Computation
93
1
55 – 92
10.1016/0890-5401(91)90052-4
http://www.sciencedirect.com/science/article/pii/0890540191900524
Lawrence C Paulson
1986
Natural deduction as higher-order resolution
The Journal of Logic Programming
3
3
237–258
10.1016/0743-1066(86)90015-4
Lawrence C Paulson
1988
A preliminary users manual for Isabelle
Technical Report
University of Cambridge, Computer Laboratory
Simon L. Peyton Jones
Philip Wadler
1993
Imperative Functional Programming
Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
POPL '93
ACM
New York, USA
71–84
10.1145/158511.158524
A. W. Roscoe
1997
The Theory and Practice of Concurrency
Prentice Hall
Andrew William Roscoe
2010
Understanding concurrent systems
Springer Science & Business Media
10.1007/978-1-84882-258-0
Steve Schneider
1999
Concurrent and Real Time Systems: The CSP Approach
1st
John Wiley
Anton Setzer
2006
Object-oriented programming in dependent type theory
http://www.cs.nott.ac.uk/~ nhn/TFP2006/TFP2006-Programme.html
In: Proceedings of TFP 2006, pp. 1 - 16.
Anton Setzer
Andreas Abel
Brigitte Pientka
David Thibodeau
2014
Unnesting of Copatterns
Gilles Dowek
Rewriting and Typed Lambda Calculi
LNCS
8560
Springer
31–45
10.1007/978-3-319-08918-8_3
Haykal Tej
Burkhart Wolff
1997
A corrected failure-divergence model for CSP in Isabelle/HOL
International Symposium of Formal Methods Europe
Springer
318–337
10.1007/3-540-63533-5_17
https://link.springer.com/chapter/10.1007/3-540-63533-5_17?LI=true
Philip Wadler
1990
Comprehending Monads
Proceedings of the 1990 ACM Conference on LISP and Functional Programming
LFP '90
ACM
New York, NY, USA
61–78
10.1145/91556.91592
Philip Wadler
1995
Monads for functional programming
Johan Jeuring
Erik Meijer
Advanced Functional Programming: First International Spring School on Advanced Functional Programming Techniques Båstad, Sweden, May 24–30, 1995 Tutorial Text
Springer
24–52
10.1007/3-540-59451-5_2