Sciweavers

3670 search results - page 133 / 734
» Linear Recursive Functions
Sort
View
POPL
2007
ACM
16 years 5 months ago
Towards a mechanized metatheory of standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
Daniel K. Lee, Karl Crary, Robert Harper
146
Voted
TLCA
2007
Springer
15 years 11 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
143
Voted
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
15 years 10 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
VVS
1998
IEEE
115views Visualization» more  VVS 1998»
15 years 9 months ago
Extracting ISO-Valued Features in 4-Dimensional Scalar Fields
Isosurfaces are an important tool for finding features in 3D scalar data. This paper describes how recursive contour meshing is applied to extract similar features in 4-dimensiona...
Chris Weigle, David C. Banks
163
Voted
LFP
1990
102views more  LFP 1990»
15 years 6 months ago
A Semantic Basis for Quest
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...
Luca Cardelli, Giuseppe Longo