Sciweavers

300 search results - page 14 / 60
» Subset Types and Partial Functions
Sort
View
FOSSACS
2010
Springer
13 years 10 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
ICFP
2001
ACM
14 years 7 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
ICA
2012
Springer
12 years 2 months ago
Contrast Functions for Independent Subspace Analysis
We consider the Independent Subspace Analysis problem from the point of view of contrast functions, showing that contrast functions are able to partially solve the ISA problem. Tha...
Jason A. Palmer, Scott Makeig
LFP
1990
102views more  LFP 1990»
13 years 8 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
ENTCS
2010
133views more  ENTCS 2010»
13 years 7 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness