2076 search results - page 315 / 416 » Functional logic overloading |
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
126
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
221
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
130
click to vote
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...