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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-cahttp://ca.dbpedia.org/resource/
n13https://global.dbpedia.org/id/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Andrew_D._Gordon
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
dbr:List_of_programming_language_researchers
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
dbr:Concurrent_computing
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
dbr:Concurrent_Haskell
rdfs:label
Concurrent Haskell Haskell concurrent
rdfs:comment
Haskell concurrent amplia Haskell98 amb concurrència explícita. Els dos conceptes principals en què es basa Haskell concurrent són les Mutable variables MVar α i la possibilitat d'engegar un nou fil d'execució via forkIO. Concurrent Haskell extends Haskell 98 with explicit concurrency. Its two main underlying concepts are: * A primitive type MVar α implementing a bounded/single-place asynchronous channel, which is either empty or holds a value of type α. * The ability to spawn a concurrent thread via the forkIO primitive. Built atop this is a collection of useful concurrency and synchronisation abstractions such as unbounded channels, semaphores and sample variables.
dct:subject
dbc:Haskell_programming_language_family
dbo:wikiPageID
4249256
dbo:wikiPageRevisionID
1058524019
dbo:wikiPageWikiLink
dbr:Monad_(functional_programming) dbr:Glasgow_Haskell_Compiler dbr:Business_logic dbr:Software_transactional_memory dbr:Thread_(computing) dbr:Atomic_actions dbr:Haskell_98 dbr:Semaphore_(programming) dbr:Processor_core dbr:Race_condition dbr:Concurrency_(computer_science) dbr:Actor_model_and_process_calculi dbc:Haskell_programming_language_family dbr:Database_transaction
owl:sameAs
freebase:m.0bs93y dbpedia-ca:Haskell_concurrent n13:4hmtp wikidata:Q5159099
dbo:abstract
Haskell concurrent amplia Haskell98 amb concurrència explícita. Els dos conceptes principals en què es basa Haskell concurrent són les Mutable variables MVar α i la possibilitat d'engegar un nou fil d'execució via forkIO. Concurrent Haskell extends Haskell 98 with explicit concurrency. Its two main underlying concepts are: * A primitive type MVar α implementing a bounded/single-place asynchronous channel, which is either empty or holds a value of type α. * The ability to spawn a concurrent thread via the forkIO primitive. Built atop this is a collection of useful concurrency and synchronisation abstractions such as unbounded channels, semaphores and sample variables. Haskell threads have very low overhead: creation, context-switching and scheduling are all internal to the Haskell runtime. These Haskell-level threads are mapped onto a configurable number of OS-level threads, usually one per processor core.
prov:wasDerivedFrom
wikipedia-en:Concurrent_Haskell?oldid=1058524019&ns=0
dbo:wikiPageLength
9247
foaf:isPrimaryTopicOf
wikipedia-en:Concurrent_Haskell
Subject Item
dbr:Haskell_features
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
dbr:Software_transactional_memory
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
dbr:Parallel_programming_model
dbo:wikiPageWikiLink
dbr:Concurrent_Haskell
Subject Item
wikipedia-en:Concurrent_Haskell
foaf:primaryTopic
dbr:Concurrent_Haskell