Sciweavers

1763 search results - page 103 / 353
» A Formalization of Polytime Functions
Sort
View
JUCS
2008
117views more  JUCS 2008»
14 years 10 months ago
Disentangling Denotational Semantics Definitions
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Fabio Tirelo, Roberto da Silva Bigonha, Joã...
JAR
2007
123views more  JAR 2007»
14 years 9 months ago
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
Alberto Ciaffaglione, Luigi Liquori, Marino Micula...
EUSFLAT
2009
144views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Number-free Mathematics Based on T-norm Fuzzy Logic
Abstract--The paper presents a form of rendering classical mathematical notions by formal theories over suitable t-norm fuzzy logics in such a way that references to real numbers a...
Libor Behounek
PLDI
2012
ACM
13 years 11 days ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...
APLAS
2010
ACM
14 years 10 months ago
JNI Light: An Operational Model for the Core JNI
Abstract. Through foreign function interfaces (FFIs), software components in different programming languages interact with each other in the same address space. Recent years have w...
Gang Tan