[Haskell-cafe] Approaches to dependent types (DT)

Hi, I am trying to understand the concept of dependent types as described in Haskell literature (Hallgren 2001),(Hinze,Jeuring et al. 2006). I am particularly interested in understanding two flavours of dependency mentioned by Hinze et al: 1) Types depending on values called dependent types 2)

[Haskell-cafe] Merging modules

Hi, I want to establish the strengths and weakness of the Haskell module system for the ontology merging task (I know it was not designed for this!). I wish to make a new module (MERGEDONTOLOGY) from three input modules one of which is common to the other two. The desired merge should contain the

Re: [Haskell-cafe] Merging modules

, pat browne wrote: To: haskell-cafe@haskell.org From: pat browne patrick.bro...@comp.dit.ie Date: Fri, 16 Oct 2009 11:42:22 +0100 Subject: [Haskell-cafe] Merging modules Hi, I want to establish the strengths and weakness of the Haskell module system for the ontology merging task (I know

[Haskell-cafe] Merging classes

Hi, Following on from my earlier *Merging modules* email, where I tried to simulate ontology merging with Haskell modules; http://article.gmane.org/gmane.comp.lang.haskell.cafe/64943 I *think* that the type of merging that I am attempting is difficult with modules so I gave classes a try. I did

Re: [Haskell-cafe] Approaches to dependent types (DT)

://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4391 and ftp://ftp.cs.kun.nl/pub/CompMath.Found/HBKJ.ps.Z On Fri, Oct 09, 2009 at 02:11:30PM +0100, pat browne wrote: Hi, I am trying to understand the concept of dependent types as described in Haskell literature (Hallgren 2001),(Hinze

[Haskell-cafe] Re: Merging modules (again)

questions are; Can the merging task be achieved using the Haskell module system? I also posted a question on how this task could be done using type classes. I would ask the same question with respect to type classes. Regards, Pat pat browne wrote: Hi, I want to establish the strengths

[Haskell-cafe] matching types in Haskell

Hi, I wish to align or match some Haskell types in order to represent a set of ontologies and their embedded concpts [1]. I am not sure wheather modules or classes could be used. I have done this task in a language called Maude[2]. The code is below. I appreciate that Maude is not very popular so

[Haskell-cafe] Peano axioms

Hi, Below are two attempts to define Peano arithmetic in Haskell. The first attempt, Peano1, consists of just a signature in the class with the axioms in the instance. In the second attempt, Peano2, I am trying to move the axioms into the class. The reason is, I want to put as much specification

[Haskell-cafe] Proof in Haskell

Hi, Below is a function that returns a mirror of a tree, originally from: http://www.nijoruj.org/~as/2009/04/20/A-little-fun.html where it was used to demonstrate the use of Haskabelle(1) which converts Haskell programs to the Isabelle theorem prover. Isabelle was used to show that the Haskell

[Haskell-cafe] river crossing puzzle

Hi, Does anyone know where there are any Haskell implementations of the the River Crossing puzzle (AKA Farmer/Fox/Goose/Grain). There are several variations but the general ideas are explained at: http://en.wikipedia.org/wiki/River_crossing_puzzle