Sciweavers

660 search results - page 23 / 132
» The Implicit Calculus of Constructions
Sort
View
FSTTCS
2008
Springer
13 years 11 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
ICDIM
2010
IEEE
13 years 8 months ago
Digital solutions for inference rules in decision-supporting systems
In this paper, we discuss the use of digital circuits in decision support systems. For this, it is first necessary to translate the descriptions of situations and conclusions whic...
Erika Matsak, Peeter Lorents
LICS
2012
IEEE
12 years 11 days ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
VIS
2004
IEEE
169views Visualization» more  VIS 2004»
14 years 11 months ago
Rendering Implicit Flow Volumes
Traditional flow volumes construct an explicit geometrical or parametrical representation from the vector field. The geometry is updated interactively and then rendered using an u...
Daqing Xue, Caixia Zhang, Roger Crawfis
EJC
2006
13 years 10 months ago
Two oiseau decompositions of permutations and their application to Eulerian calculus
: Two transformations are constructed that map the permutation group onto a well-defined subset of a partially commutative monoid generated by the so-called oiseaux. Those transfor...
Dominique Foata, Arthur Randrianarivony