This HTML5 document contains 26 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Implicit_computational_complexity
rdfs:label
Complexité implicite Implicit computational complexity
rdfs:comment
Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which they are constructed, without reference to a specific underlying machine model or to explicit bounds on computational resources unlike conventional complexity theory. ICC was developed in the 1990s and employs the techniques of proof theory, substructural logic, model theory and recursion theory to prove bounds on the expressive power of high-level formal languages. ICC is also concerned with the practical realization of functional programming languages, language tools and type theory that can control the resource usage of programs in a formally verifiable sense. En informatique théorique, la complexité implicite est une branche de la théorie de la complexité calculatoire qui caractérise les classes de complexité par des restrictions syntaxiques sur le langage de programmation de haut niveau.
dcterms:subject
dbc:Computational_complexity_theory
dbo:wikiPageID
53458309
dbo:wikiPageRevisionID
901632560
dbo:wikiPageWikiLink
dbr:Computational_complexity_theory dbr:Proof_theory dbr:Recursion_theory dbr:Type_systems dbc:Computational_complexity_theory dbr:Functional_programming dbr:Model_theory dbr:Substructural_logic
owl:sameAs
dbpedia-fr:Complexité_implicite wikidata:Q30324433 n15:2p6LN
dbp:wikiPageUsesTemplate
dbt:Unreferenced dbt:Comp-sci-theory-stub
dbo:abstract
En informatique théorique, la complexité implicite est une branche de la théorie de la complexité calculatoire qui caractérise les classes de complexité par des restrictions syntaxiques sur le langage de programmation de haut niveau. Implicit computational complexity (ICC) is a subfield of computational complexity theory that characterizes algorithms by constraints on the way in which they are constructed, without reference to a specific underlying machine model or to explicit bounds on computational resources unlike conventional complexity theory. ICC was developed in the 1990s and employs the techniques of proof theory, substructural logic, model theory and recursion theory to prove bounds on the expressive power of high-level formal languages. ICC is also concerned with the practical realization of functional programming languages, language tools and type theory that can control the resource usage of programs in a formally verifiable sense. * v * t * e
prov:wasDerivedFrom
wikipedia-en:Implicit_computational_complexity?oldid=901632560&ns=0
dbo:wikiPageLength
882
foaf:isPrimaryTopicOf
wikipedia-en:Implicit_computational_complexity
Subject Item
wikipedia-en:Implicit_computational_complexity
foaf:primaryTopic
dbr:Implicit_computational_complexity