1916 search results - page 25 / 384 » Reasoning with class algebra |
CADE
1998
Springer
14 years 2 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
GC
2011
Springer
13 years 1 months ago
2011
Springer
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
IEEEARES
2009
IEEE
14 years 4 months ago
2009
IEEE
—Alice and Bob notation is a popular way to describe security protocols: it is intuitive, succinct, and yet expressive. Several formal protocol specification languages are based...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...