Search results

...WSML - a Language Framework for Semantic Web Service. W3C Workshop on Rule Languages for Interoperability, Washington USA, 27–28 April 2005. http://dip.semantic ...Fensel: The WSML rule languages for the Semantic Web. W3C Workshop on Rule Languages for Interoperability, Washington USA, 27–28 April 2005. http://dip.semantic ...

{{Short description|Constraint logic programming language}} ...hmetic in a logic programming language differs from other constraint logic programming ...

...ecification|book-title=Proceedings of the IFIP International Conference on Programming Concepts and Methods|volume=125|pages=148–166|publisher=Chapman & Hall|year ...|url=https://doi.org/10.1145/3591283|doi-access=free }}</ref> and [[Scala (programming language)|Scala]]. ...

...roceedings of the 17th International Colloquium on Automata, Languages and Programming | editor1-first = Michael S. | editor1-last = Paterson | publisher = [[Spri ...utation tree logic|computation tree logic (branching time logic)]]([[modal logic]]). So-called ''branching bisimulation'' has to be used.{{Citation needed|d ...

{{Short description|Probabilistic logic programming language}} | programming language = [[Python (programming language)|Python]] ...

...lgebra with tests: Completeness and decidability |journal=Computer Science Logic |date=September 1996b |volume=1258 |pages=244–259 |doi=10.1007/3-540-63172- ...|title=Kleene algebra with tests |journal=ACM Transactions on Programming Languages and Systems |date=May 1997 |volume=19 |issue=3 |pages=427–443 |doi=10.1145/ ...

| programming language = [[C++]] ...extensional arrays, datatypes, uninterpreted functions, and [[quantifier (logic)|quantifier]]s. Its main applications are [[extended static checking]], tes ...

In the area of [[mathematical logic]] and [[computer science]] known as [[type theory]], a '''type constructor' Some [[Functional programming|functional programming languages]] make explicit use of type constructors. A notable example is [[Haskell]], ...

The [[Judgment (mathematical logic)|judgement]] In [[statically typed]] [[programming language]]s, these environments are used and maintained by [[typing rule]]s ...

{{Short description|Knowledge representation computer programming language}} ...h inductive definitions |journal=International Conference on Computational Logic |date=2000 |pages=703–717 |doi= |arxiv=cs/0003019 |bibcode=2000cs........30 ...

In the area of [[mathematical logic]] and [[computer science]] known as [[type theory]], a '''kind''' is the ty ...uregina.ca}}</ref> [[Haskell (programming language)|Haskell]] and [[Scala (programming language)|Scala]]<!-- have to check Scala, but I bet it allows parametric p ...

'''Disjunctive Datalog''' is an extension of the [[logic programming language]] [[Datalog]] that allows [[Logical disjunction|disjunctions]] in * [[Syntax and semantics of logic programming]] ...

...s of machine states and transitions (see [[formal semantics of programming languages]]), their state spaces may be too large to fully represent and analyse. Mod ...itle=Proc. 4th Int. Symp. on Programming Language Implementation and Logic Programming (PLILP)|date=Aug 1992| volume=631| pages=269–296| publisher=Springer| edito ...

...ntext-free language]] in terms of two simpler languages. These two simpler languages, namely a [[regular language]] and a [[Dyck language]], are combined by mea |chapter= Context-Free Languages and Push-Down Automata ...

...n ''Proceedings of the International Colloquium on Automata, Languages and Programming'', Graz, Lecture Notes in Computer Science 71, Springer-Verlag, pp.&nbsp;18 [[Category:Formal languages]] ...

{{Infobox programming language | influenced_by = [[Pascal (programming language)|Pascal]] ...

{{Short description|Fragment of first-order logic}} ...-0684|quote=CHCs are syntactically and semantically the same as constraint logic programs|doi-access=free |arxiv=2108.00739 }}</ref> ...

{{Short description|Formal semantics of logic programming languages}} ...Confusingly, the name "logic programming" also refers to a {{em|specific}} programming language that roughly corresponds to the declarative subset of Prolog. Unfo ...

...=Introduction to generalized type systems |journal=[[Journal of Functional Programming]] |volume=1 |issue=2 |pages=125–154 |year=1991 |doi=10.1017/s09567968000200 ...f Torino]] | year = 1990 }}</ref> Berardi defined a cube of [[constructive logic]]s akin to the lambda cube (these specifications are non-dependent). A modi ...

...first1=Cliff B. |editor-first1=C. B |editor-last1=Jones |title=Programming Languages and Their Definition |date=1984 |volume=177 |doi=10.1007/BFb0048933 |chapte ...s-CSL-2016-6.pdf |journal=25th EACSL Annual Conference on Computer Science Logic (CSL 2016) |series=Leibniz International Proceedings in Informatics (LIPIcs ...