This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
M. Abadi & L. Cardelli (eds). (1996) A Theory of Objects, Monographs in Computer Science. Springer.
A. Abel (2008) Semi-continuous sized types and termination. Log. Meth. Comput. Sci.
(2:3), 1–33 (CSL'06 special issue).
A. Abel & B. Pientka (2013) Wellfounded recursion with copatterns: A unified approach to termination and productivity. In G. Morrisett & T. Uustalu (eds) Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013. ACM, pp. 185–196.
T. Altenkirch & P. Morris (2009) Indexed containers. In Proceedings of the 24nd IEEE Symposium on Logic in Computer Science, LICS 2009. IEEE Computer Society, pp. 277–285.
R. M. Amadio & S. Coupet-Grimal (1998) Analysis of a guard condition in type theory (extended abstract) In M. Nivat (ed), Proceedings of the 1st International Conference on Foundations of Software Science and Computation Structure, FOSSACS'98, Lecture Notes in Computer Science, vol. 1378. Springer, pp. 48–62.
G. Barthe , M. J. Frade , E. Giménez , L. Pinto & T. Uustalu (2004) Type-based termination of recursive definitions. Math. Struct. Comput. Sci.
A. Bauer & M. Pretnar (2015) Programming with algebraic effects and handlers. J. Log. Algebr. Methods Program.
J. C. Blanchette , A. Popescu & D. Traytel (2015) Foundational extensible corecursion: a proof assistant perspective. In K. Fisher & J. H. Reppy (eds), Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015. ACM, pp. 192–204.
T. Coquand (1994) Infinite objects in type theory. In H. Barendregt & T. Nipkow (eds), Proceedings of the International Workshop on Types for Proofs and Programs, TYPES '93, Lecture Notes in Computer Sciience, vol. 806. Springer, pp. 62–78.
P. Dybjer (1994) Inductive families. Formal Asp. Comput.
P. Dybjer & A. Setzer (2003) Induction-recursion and initial algebras.
Ann. Pure Appl. Logic
R. Garcia , É. Tanter , R. Wolff & J. Aldrich (2014) Foundations of typestate-oriented programming. ACM Trans. Program. Lang. Syst.
J. G. Granström (2012) A new paradigm for component-based development. J. Softw.
P. Hancock & P. Hyvernat (2006) Programming interfaces and basic topology. Ann. Pure Appl. Log.
P. Hancock , C. McBride , N. Ghani , L. Malatesta & T. Altenkirch (2013) Small induction recursion. In M. Hasegawa (ed), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 7941. Berlin, Heidelberg: Springer, pp. 156–172.
P. Hancock & A. Setzer (2005) Interactive programs and weakly final coalgebras in dependent type theory. In L. Crosilla & P. Schuster (eds), From Sets and Types to Topology and Analysis. Towards Practicable Foundations for Constructive Mathematics, Oxford Logic Guides. Oxford: Oxford Univ. Press.
T. Harris , S. Marlow , S. L. Peyton Jones & M. Herlihy (2008) Composable memory transactions. Commun. ACM
R. Hirschfeld , P. Costanza & O. Nierstrasz (2008) Context-oriented programming. J. Obj. Tech.
A. J. C. Hurkens (1995) A simplification of Girard's paradox. In M. Dezani-Ciancaglini & G. D. Plotkin (eds), Proceedings of the 2nd International Conference on Typed Lambda Calculi and Applications, TLCA '95, Lecture Notes in Computer Science, vol. 902. Springer, pp. 266–278.
B. Igried & A. Setzer (2016) Programming with monadic CSP-style processes in dependent type theory. In Proceedings of the 1st International Workshop on Type-Driven Development, TyDe 2016, New York: ACM, pp. 28–38.
D. Leijen (2004) wxHaskell: A portable and concise GUI library for Haskell. In H. Nilsson (ed).Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2004
ACM Press, pp. 57–68.
R. Matthes (2002) Tarski's fixed-point theorem and lambda calculi with monotone inductive types. Synthese
E. Moggi (1991) Notions of computation and monads. Inf. Comput.
K. Petersson & D. Synek (1989) A set constructor for inductive sets in Martin-Löf's Type Theory. In D. H. Pitt , D. E. Rydeheard , P. Dybjer , A. M. Pitts & A. Poigné (eds), Category Theory and Computer Science, Lecture Notes in Computer Science, vol. 389. London: Springer-Verlag, pp. 128–140.
A. Setzer (2012) Coalgebras as types determined by their elimination rules. In P. Dybjer , S. Lindström , E. Palmgren & G. Sundholm (eds), Epistemology versus Ontology Logic, Epistemology, and the Unity of Science, vol. 27. Springer Netherlands, pp. 351–369. doi: 10.1007/978-94-007-4435-6_16.
A. Setzer (2016) How to reason coinductively informally. In R. Kahle , T. Strahm & T. Studer (eds), Advances in Proof Theory. Springer, pp. 377–408.
A. Stump (2016) Verified Functional Programming in Agda. Morgan & Claypool.