Results 1  10
of
44
• Strict Superset of C.
"... ObjectiveC is a thin layer on top of C, and moreover is a strict superset of C. • Use Message Syntax [rectangle setWidth:2 andHeight:3]; • ObjectiveC is a dynamictyping language but also supports “statictyping ” for objects. ..."
Abstract
 Add to MetaCart
ObjectiveC is a thin layer on top of C, and moreover is a strict superset of C. • Use Message Syntax [rectangle setWidth:2 andHeight:3]; • ObjectiveC is a dynamictyping language but also supports “statictyping ” for objects.
Pizza into Java: Translating theory into practice
 In Proc. 24th ACM Symposium on Principles of Programming Languages
, 1997
"... Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because ..."
Abstract

Cited by 336 (15 self)
 Add to MetaCart
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza attempts to make these ideas accessible by translating them into Java. We mean that both figuratively and literally, because
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 199 (9 self)
 Add to MetaCart
We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method
On feedback in network source coding
, 2009
"... We consider source coding over networks with unlimited feedback from the sinks to the sources. We first show examples of networks where the rate region with feedback is a strict superset of that without feedback. Next, we find an achievable region for multiterminal lossy source coding with feedbac ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We consider source coding over networks with unlimited feedback from the sinks to the sources. We first show examples of networks where the rate region with feedback is a strict superset of that without feedback. Next, we find an achievable region for multiterminal lossy source coding
Testing Equivalence Probabilistically
 COMPUTER SCIENCE DEPARTMENT, UCLA
, 2002
"... Although the equivalence of two Ordered Binary Decision Diagrams (OBDDs) can be decided in polynomial time, the equivalence of two Free Binary Decision Diagrams (FBDDs) is only known to be probabilistically decidable in polynomial time. FBDDs are a strict superset of OBDDs, and are more succinct ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Although the equivalence of two Ordered Binary Decision Diagrams (OBDDs) can be decided in polynomial time, the equivalence of two Free Binary Decision Diagrams (FBDDs) is only known to be probabilistically decidable in polynomial time. FBDDs are a strict superset of OBDDs, and are more succinct
Binary Encodings for JavaScript Object
, 2013
"... drafthallambakerjsonbcd00 Three binary encodings for JavaScript Object Notation (JSON) are presented. JSONB (Binary) is a strict superset of the JSON encoding that permits efficient binary encoding of intrinsic JavaScript data types. JSONC (Compact) is a strict superset of JSONB that supports ..."
Abstract
 Add to MetaCart
drafthallambakerjsonbcd00 Three binary encodings for JavaScript Object Notation (JSON) are presented. JSONB (Binary) is a strict superset of the JSON encoding that permits efficient binary encoding of intrinsic JavaScript data types. JSONC (Compact) is a strict superset of JSONB that supports
Binary Encodings for JavaScript Object
, 2014
"... drafthallambakerjsonbcd01 Three binary encodings for JavaScript Object Notation (JSON) are presented. JSONB (Binary) is a strict superset of the JSON encoding that permits efficient binary encoding of intrinsic JavaScript data types. JSONC (Compact) is a strict superset of JSONB that supports ..."
Abstract
 Add to MetaCart
drafthallambakerjsonbcd01 Three binary encodings for JavaScript Object Notation (JSON) are presented. JSONB (Binary) is a strict superset of the JSON encoding that permits efficient binary encoding of intrinsic JavaScript data types. JSONC (Compact) is a strict superset of JSONB that supports
Exceptions Are Strictly More Powerful Than Call Cc
 HigherOrder and Symbolic Computation
, 1995
"... We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more powerful than call/cc. More precisely, we prove that the simply typed lambda calculus extended with exceptions is strictly more powerful than Girard's F [6, 15] (a superset of ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more powerful than call/cc. More precisely, we prove that the simply typed lambda calculus extended with exceptions is strictly more powerful than Girard's F [6, 15] (a superset
Macro Forest Transducers
 Information Processing Letters
, 2004
"... Abstract Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented as binar ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
Abstract Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented
Abstract Pizza into Java: Translating theory into practice
"... Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain the des ..."
Abstract
 Add to MetaCart
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higherorder functions, and algebraic data types. Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain
Results 1  10
of
44