Sciweavers

230 search results - page 16 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
ILP
1998
Springer
13 years 12 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...
LOPSTR
2004
Springer
14 years 1 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
14 years 2 months ago
Web Application Scanners: Definitions and Functions
There are many commercial software security assurance tools that claim to detect and prevent vulnerabilities in application software. However, a closer look at the tools often lea...
Elizabeth Fong, Vadim Okun
CADE
2007
Springer
14 years 8 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
LOPSTR
2005
Springer
14 years 1 months ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus