Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Math. Struct. in Comp. Science Relative monads formalised
 

Summary: Under consideration for publication in Math. Struct. in Comp. Science
Relative monads formalised
THORSTEN ALTENKIRCH1
, JAMES CHAPMAN2
and TARMO UUSTALU2
1
School of Computer Science, University of Nottingham,
Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB, UK
2
Institute of Cybernetics, Tallinn University of Technology,
Akadeemia tee 21, 12618 Tallinn, Estonia
Received July 31, 2010
Relative monads are a generalisation of ordinary monads where the underlying functor
need not be an endofunctor. In this paper, we describe a formalisation of the basic
theory of relative monads in the interactive theorem prover and dependently typed
programming language Agda. This comprises the requisite basic category theory, the
central concepts of the theory of relative monads and adjunctions, compared to their
ordinary counterparts, and two running examples from programming theory.
1 Introduction
Relative monads (Altenkirch, Chapman, and Uustalu 2010) are a recent generalisation

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences