Sciweavers

230 search results - page 19 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
TPHOL
2003
IEEE
14 years 28 days ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 2 months ago
Using automated search to generate test data for matlab
The critical functionality of many software applications relies on code that performs mathematically complex computations. However, such code is often difficult to test owing to t...
Sion Ll Rhys, Simon M. Poulding, John A. Clark
ICFP
2001
ACM
14 years 7 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
CSL
2004
Springer
13 years 11 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
FSTTCS
1993
Springer
13 years 11 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell