Sciweavers

891 search results - page 8 / 179
» Full Abstraction for PCF
Sort
View
PPDP
2009
Springer
14 years 2 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
SIAMADS
2010
82views more  SIAMADS 2010»
13 years 2 months ago
Homoclinic Orbits of the FitzHugh-Nagumo Equation: Bifurcations in the Full System
Abstract. This paper investigates travelling wave solutions of the FitzHugh
John Guckenheimer, Christian Kuehn
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Abstract Families of Abstract Categorial Languages
Families of Categorial Languages Makoto Kanazawa 1 National Institute of Informatics Tokyo, Japan We show that the class of string languages generated by abstract categorial gramm...
Makoto Kanazawa
POPL
2006
ACM
14 years 8 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
CIE
2005
Springer
13 years 9 months ago
Shrad: A Language for Sequential Real Number Computation
Since Di Gianantonio [1993] introduced his semantics for exact real omputation, there has always been a struggle to maintain data abstraction and efficiency as much as possible. T...
Amin Farjudian