Abstract
The goal of this paper is to investigate the use of a software technology – the pseudoconstructors over monadic values (structures capable of simultaneously representing both syntax and semantics) – to build modular entry-pointless type checkers using the VHLL Haskell. A template used by almost all the modules of the modular monadic entry-pointless type checker is also revealed.
Cuvinte cheie
pseudoconstructor(s)
modular monadic typechecker in Haskell