Dependent Types and Fibred Computational Effects

Conference paper

DOI: 10.1007/978-3-662-49630-5_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9634)
Cite this paper as:
Ahman D., Ghani N., Plotkin G.D. (2016) Dependent Types and Fibred Computational Effects. In: Jacobs B., Löding C. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2016. Lecture Notes in Computer Science, vol 9634. Springer, Berlin, Heidelberg


We study the interplay between dependent types and general computational effects. We define a language with both value types and terms, and computation types and terms, where types depend only on value terms. We use computational \(\varSigma \)-types to account for type-dependency in the sequential composition of computations. Our language design is justified by a natural class of categorical models. We account for both algebraic and non-algebraic effects. We also show how to extend the language with general recursion, using continuous families of cpos.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.LFCSUniversity of EdinburghEdinburghScotland, UK
  2. 2.MSP GroupUniversity of StrathclydeGlasgowScotland, UK

Personalised recommendations