Sciweavers

894 search results - page 61 / 179
» Typed Contracts for Functional Programming
Sort
View
FLOPS
1999
Springer
14 years 1 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
SCP
2011
255views Communications» more  SCP 2011»
13 years 3 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
PEPM
2000
ACM
14 years 8 days ago
Calculating Sized Types
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
Wei-Ngan Chin, Siau-Cheng Khoo
PLPV
2009
ACM
14 years 5 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 8 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris