Sciweavers

278 search results - page 21 / 56
» Pure Pattern Calculus
Sort
View
LICS
2005
IEEE
14 years 3 months ago
Eager Normal Form Bisimulation
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus, called enf bisimilarity and enf bisimilarity up to η. They are based on eag...
Soren Lassen
KR
2010
Springer
13 years 12 months ago
Integrating Action Calculi and AgentSpeak: Closing the Gap
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
Michael Thielscher
LISP
2007
112views more  LISP 2007»
13 years 9 months ago
The next 700 Krivine machines
: The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure λ-terms. While its original description has remained unpublished, ...
Rémi Douence, Pascal Fradet
IANDC
2010
119views more  IANDC 2010»
13 years 8 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
VTS
1995
IEEE
100views Hardware» more  VTS 1995»
14 years 1 months ago
Transformed pseudo-random patterns for BIST
This paper presents a new approach for on-chip test pattern generation. The set of test patterns generated by a pseudo-random pattern generator (e.g., an LFSR) is transformed into...
Nur A. Touba, Edward J. McCluskey