Sciweavers

34 search results - page 2 / 7
» Haskell Is Not Not ML
Sort
View
124
Voted
ICFP
2008
ACM
16 years 1 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
139
Voted
ICFP
2012
ACM
13 years 3 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
113
Voted
JFP
2007
103views more  JFP 2007»
15 years 1 months ago
Warnings for pattern matching
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, ...
Luc Maranget
123
Voted
TPHOL
2008
IEEE
15 years 7 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
206
Voted
ICFP
2009
ACM
16 years 1 months ago
Parallel concurrent ML
Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite ...
John H. Reppy, Claudio V. Russo, Yingqi Xiao