Sciweavers

215 search results - page 39 / 43
» Connecting a Logical Framework to a First-Order Logic Prover
Sort
View
FOSSACS
2005
Springer
15 years 3 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
84
Voted
SAC
2010
ACM
15 years 4 months ago
SE-155 DBSA: a device-based software architecture for data mining
In this paper a new architecture for a variety of data mining tasks is introduced. The Device-Based Software Architecture (DBSA) is a highly portable and generic data mining softw...
Janne Kätevä, Perttu Laurinen, Taneli Ra...
ICFP
2006
ACM
15 years 9 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers
TCS
2002
14 years 9 months ago
A unified language processing methodology
This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodolo...
Teodor Rus
ICFP
2007
ACM
15 years 9 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop