Sciweavers

1999 search results - page 132 / 400
» Dependently Typed Grammars
Sort
View
TLCA
2007
Springer
16 years 12 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
15 years 11 months 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
POPL
1993
ACM
15 years 10 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
STACS
2010
Springer
16 years 1 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
IAW
2003
IEEE
15 years 11 months ago
Insecure Programming: How Culpable is a Language's Syntax?
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...
Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman,...