Sciweavers

1023 search results - page 49 / 205
» A Formal Method for Program Slicing
Sort
View
SAS
1991
Springer
15 years 8 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
155
Voted
FMCO
2006
Springer
135views Formal Methods» more  FMCO 2006»
15 years 8 months ago
Links: Web Programming Without Tiers
Links is a programming language for web applications that generates code for all three tiers of a web application from a single source, compiling into JavaScript to run on the clie...
Ezra Cooper, Sam Lindley, Philip Wadler, Jeremy Ya...
TYPES
2004
Springer
15 years 10 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
15 years 10 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
15 years 8 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