Sciweavers

128 search results - page 20 / 26
» Data-driven Induction of Functional Programs
Sort
View
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
PLPV
2009
ACM
14 years 4 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
APLAS
2005
ACM
14 years 1 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
ILP
2007
Springer
14 years 1 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi