Semantic Scholar uses AI to extract papers important to this topic.
Many distributed systems rely on token structures for their correct operation. Often, these structures make sure that a fixed… Expand Grammars might be used for various other aspects, than just to represent a language. Grammar inference is a large field which… Expand We introduce the principles of symbolization and conceptualization of perceived reality. We show them as processes that are… Expand In previous work [27, 26] the author defined a notion of CSP-like operational semantics whose main restrictions were the… Expand We present TEA, a tool that is able to detect termination of functions written in a non-strict high-level functional programming… Expand We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as… Expand The notion of continuation is ubiquitous in many different areas of computer science, including logic, constructive mathematics… Expand This paper describes a new approach for debugging lazy functional languages. It rests on the fact that a functional program is… Expand The usual way for integrating strict and lazy evaluation in functional programming is the introduction of an explicit “freeze… Expand