Sciweavers

4211 search results - page 119 / 843
» Types as Abstract Interpretations
Sort
View
111
Voted
ICALP
2004
Springer
15 years 9 months ago
A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems
We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predica...
Shin-ya Katsumata
156
Voted
TPHOL
2000
IEEE
15 years 8 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow
143
Voted
CASC
2010
Springer
155views Mathematics» more  CASC 2010»
15 years 2 months ago
Type Specialization in Aldor
Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametri...
Laurentiu Dragan, Stephen M. Watt
124
Voted
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
15 years 7 months ago
Use of statistical outlier detection method in adaptive evolutionary algorithms
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
122
Voted
EUROPAR
2008
Springer
15 years 5 months ago
Parallel Algorithms for Triangular Periodic Sylvester-Type Matrix Equations
Abstract. We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels
Per Andersson, Robert Granat, Isak Jonsson, Bo K&a...