Sciweavers

1940 search results - page 244 / 388
» Graph Transformation with Variables
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 4 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 4 months ago
Space and the Synchronic A-Ram
Space is a spatial programming language designed to exploit the massive parallelism available in a formal model of computation called the Synchronic A-Ram, and physically related ...
Alexander Victor Berka
ANOR
2006
100views more  ANOR 2006»
15 years 4 months ago
A BMAP/G/1 Retrial Queue with a Server Subject to Breakdowns and Repairs
In this paper, we consider a BMAP/G/1 retrial queue with a server subject to breakdowns and repairs, where the life time of the server is exponential and the repair time is general...
Quan-Lin Li, Yu Ying, Yiqiang Q. Zhao
JANCL
2008
170views more  JANCL 2008»
15 years 4 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
TPLP
2008
89views more  TPLP 2008»
15 years 4 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...