Sciweavers

1932 search results - page 267 / 387
» A Functional Quantum Programming Language
Sort
View
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
16 years 4 days ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 4 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel
JUCS
2002
116views more  JUCS 2002»
15 years 6 months ago
Design for All as a Challenge for Hypermedia Engineering
: Design for All is an important challenge for hypermedia engineering. We analyze this challenge and show that it is necessary to find a way of describing partially designed hyperm...
Volker Mattick
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 6 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
ICALP
2009
Springer
16 years 7 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong