konsu [EMAIL PROTECTED] wrote in message
news:ATOx8.42722$[EMAIL PROTECTED]...
hello,
as an exercise, i am trying to implement a pure lambda calculus
interpreter.
i am using normal order reduction with textual substitution of terms.
I errorneously specified categories as
class (Eq object, Eq morphism) =
Category id object morphism | id -, id - morphism
where o :: id - morphism - morphism - Maybe morphism
dom, cod :: id - morphism - object
it should have been
class (Eq object, Eq morphism) =
Konst,
From: Konst Sushenko [EMAIL PROTECTED]
Subject: free variables in lambda terms ?
Date: Thu, 25 Apr 2002 20:07:01 -0700
hi, would someone please help me with the question below? i tried asking
on comp.lang.functional list but noone responded...
konsu [EMAIL PROTECTED] wrote in
| Yet another H98 question, this time regarding the module
| Char: Is it a deliberate design decision that readLitChar
| handles decimal, octal, and hex escapes, but lexLitChar
| handles only decimal ones? It looks more like an oversight to me...
Me too. It's a messy part of the language
Would there be any problems if there were an artificial - type
constructor in Haskell which was basically:
type a - b = b - a
but not a type synonym so you could define it to be instances of classes,
but then those get applied backwards to -?
Okay, that made no sense. I'll try again. Type
