Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Pre-Defined Functions isaconstr
 

Summary: Pre-Defined Functions
· bot :: a
· isaconstr :: type -> Bool
for all constr Con, where constr :: type1
-> . . . -> typen
-> type
· argofconstr :: type -> (type1
, . . . , typen
)
for all constr Con, wobei constr :: type1
-> . . . -> typen
-> type
· isa( ) :: ( ) -> Bool
· seln,i :: (a1, . . . , an) -> ai
for all 2 n k, 1 i n.
append Nil z = z
append (Cons x y) z = Cons x (append y z)
(1)
append = \x1 x2 -> case (x1, x2) of (Nil, z) -> z
(Cons x y, z) -> Cons x (append y z)

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences