Sciweavers

4211 search results - page 72 / 843
» Types as Abstract Interpretations
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
15 years 3 months ago
Gene set analyses for interpreting microarray experiments on prokaryotic organisms
Background: Despite the widespread usage of DNA microarrays, questions remain about how best to interpret the wealth of gene-by-gene transcriptional levels that they measure. Rece...
Nathan L. Tintle, Aaron A. Best, Matthew DeJongh, ...
ENTCS
2007
109views more  ENTCS 2007»
15 years 3 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
127
Voted
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
132
Voted
ICFP
2001
ACM
16 years 3 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
CSFW
2000
IEEE
15 years 7 months ago
How to Prevent Type Flaw Attacks on Security Protocols
A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number o...
James Heather, Gavin Lowe, Steve Schneider