Sciweavers

1982 search results - page 116 / 397
» Parametricity and dependent types
Sort
View
LICS
1987
IEEE
15 years 10 months ago
A Framework for Defining Logics
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
Robert Harper, Furio Honsell, Gordon D. Plotkin
AMC
2010
71views more  AMC 2010»
15 years 6 months ago
Exact multiplicity of solutions to a diffusive logistic equation with harvesting
An Ambrosetti-Prodi type exact multiplicity result is proved for a diffusive logistic equation with harvesting. We show that a modified diffusive logistic mapping has exactly eith...
Yanan Wang, Yuwen Wang, Junping Shi
TLCA
2007
Springer
16 years 23 days ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
IFIP
2004
Springer
16 years 23 hour ago
Pattern-Matching Spi-Calculus
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
Christian Haack, Alan Jeffrey
BMCBI
2010
85views more  BMCBI 2010»
15 years 6 months ago
Robust test method for time-course microarray experiments
Background: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectorie...
Insuk Sohn, Kouros Owzar, Stephen L. George, Sujon...