650 search results - page 57 / 130 » Logical Bisimulations and Functional Languages |
POPL
1997
ACM
13 years 12 months ago
1997
ACM
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
DIAGRAMS
2004
Springer
13 years 11 months ago
2004
Springer
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
ISMVL
2007
IEEE
14 years 2 months ago
2007
IEEE
Designing modern circuits comprised of millions of gates is a very challenging task. Therefore new directions are investigated for efficient modeling and verification of such syst...
ECAI
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
NJC
2000
13 years 7 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...