Sciweavers

1154 search results - page 82 / 231
» Implementing Typed Intermediate Languages
Sort
View
APLAS
2010
ACM
14 years 10 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
15 years 2 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
ICFP
2010
ACM
14 years 10 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
JIRS
2007
229views more  JIRS 2007»
14 years 9 months ago
Unmanned Vehicle Controller Design, Evaluation and Implementation: From MATLAB to Printed Circuit Board
A detailed step-by-step approach is presented to optimize, standardize, and automate the process of unmanned vehicle controller design, evaluation, validation and verification, fol...
Daniel Ernst, Kimon P. Valavanis, Richard Garcia, ...
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
15 years 1 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones