Sciweavers

4757 search results - page 456 / 952
» Monads for Functional Programming
Sort
View
LICS
2007
IEEE
16 years 1 months ago
Relational Parametricity for Computational Effects
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
Rasmus Ejlers Møgelberg, Alex Simpson
TLCA
2007
Springer
16 years 29 days ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
ICALT
2006
IEEE
16 years 27 days ago
Implementation of a Personalized Assessment Web Service
This paper describes the design, development and qualitative evaluation of a web-based personalized assessment service of an object–oriented programming course at the University...
Lilia Cheniti-Belcadhi, Nicola Henze, Rafik Braham
APSEC
2005
IEEE
16 years 14 days ago
Model Checking Interrupt-Dependent Software
Embedded control programs are hard to analyse because their behaviour depends on how they interact with hardware devices. In particular, embedded code typically uses interrupts to...
Colin J. Fidge, Phil Cook
APLAS
2005
ACM
16 years 12 days ago
A Simple Semantics for Polymorphic Recursion
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
William L. Harrison