38 search results - page 1 / 8 » Permutative Logic |
LPAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
ISCAS
2005
IEEE
13 years 11 months ago
2005
IEEE
- The inclusion of programmable logic cores in modern SoCs motivates the need for an access network to make full use of this resource. The programmable nature of these cores remove...
CSL
2005
Springer
13 years 11 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
FPGA
1992
ACM
13 years 9 months ago
1992
ACM
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...