Sciweavers

745 search results - page 116 / 149
» The Functional Side of Logic Programming
Sort
View
144
Voted
ICFP
2008
ACM
16 years 3 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
16 years 19 days ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
374
Voted
JTRES
2010
ACM
15 years 4 months ago
The design of SafeJML, a specification language for SCJ with support for WCET specification
Safety-Critical Java (SCJ) is a dialect of Java that allows programmers to implement safety-critical systems, such as software to control airplanes, medical devices, and nuclear p...
Ghaith Haddad, Faraz Hussain, Gary T. Leavens
LOPSTR
2004
Springer
15 years 9 months ago
Natural Rewriting for General Term Rewriting Systems
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
Santiago Escobar, José Meseguer, Prasanna T...
149
Voted
POPL
1997
ACM
15 years 8 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones