Matches in DBpedia 2014 for { <http://dbpedia.org/resource/POPLmark_challenge> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- POPLmark_challenge abstract "In programming language theory, the POPLmark challenge (formerly Mechanized Metatheory for the Masses!) is a set of benchmarks designed to evaluate the state of mechanization in the metatheory of programming languages, and to stimulate discussion and collaboration among a diverse cross section of the formal methods community. The challenge was initially proposed by the members of the PL club at the University of Pennsylvania, in association with collaborators around the world. The Workshop on Mechanized Metatheory is the main meeting of researchers participating in the challenge.The design of the POPLmark benchmark is guided by features common to reasoning about programming languages. The challenge problems do not require the formalisation of large programming languages, but they do require sophistication in reasoning about: Binding Most programming languages have some form of binding, ranging in complexity from the simple binders of simply typed lambda calculus to complex, potentially infinite binders needed in the treatment of record patterns. Induction Properties such as subject reduction and strong normalisation often require complex induction arguments. Reuse Furthering collaboration being a key aim of the challenge, the solutions are expected to contain reusable components that would allow researchers to share language features and designs without requiring them to start from scratch every time.".
- POPLmark_challenge wikiPageExternalLink abella.cs.umn.edu.
- POPLmark_challenge wikiPageExternalLink index.php?title=The_POPLmark_Challenge.
- POPLmark_challenge wikiPageExternalLink aprolog.
- POPLmark_challenge wikiPageID "10323007".
- POPLmark_challenge wikiPageRevisionID "474778682".
- POPLmark_challenge hasPhotoCollection POPLmark_challenge.
- POPLmark_challenge noFootnotes "January 2011".
- POPLmark_challenge refimprove "January 2011".
- POPLmark_challenge subject Category:Formal_methods.
- POPLmark_challenge subject Category:Programming_language_theory.
- POPLmark_challenge subject Category:Unsolved_problems_in_computer_science.
- POPLmark_challenge type Ability105616246.
- POPLmark_challenge type Abstraction100002137.
- POPLmark_challenge type Attribute100024264.
- POPLmark_challenge type Cognition100023271.
- POPLmark_challenge type Condition113920835.
- POPLmark_challenge type Difficulty114408086.
- POPLmark_challenge type FormalMethods.
- POPLmark_challenge type Know-how105616786.
- POPLmark_challenge type Method105660268.
- POPLmark_challenge type Problem114410605.
- POPLmark_challenge type PsychologicalFeature100023100.
- POPLmark_challenge type State100024720.
- POPLmark_challenge type UnsolvedProblemsInComputerScience.
- POPLmark_challenge type ProgrammingLanguage.
- POPLmark_challenge type Software.
- POPLmark_challenge type Work.
- POPLmark_challenge type CreativeWork.
- POPLmark_challenge type InformationEntity.
- POPLmark_challenge comment "In programming language theory, the POPLmark challenge (formerly Mechanized Metatheory for the Masses!) is a set of benchmarks designed to evaluate the state of mechanization in the metatheory of programming languages, and to stimulate discussion and collaboration among a diverse cross section of the formal methods community. The challenge was initially proposed by the members of the PL club at the University of Pennsylvania, in association with collaborators around the world.".
- POPLmark_challenge label "POPLmark challenge".
- POPLmark_challenge sameAs m.02q8g3v.
- POPLmark_challenge sameAs Q7120017.
- POPLmark_challenge sameAs Q7120017.
- POPLmark_challenge sameAs POPLmark_challenge.
- POPLmark_challenge wasDerivedFrom POPLmark_challenge?oldid=474778682.
- POPLmark_challenge isPrimaryTopicOf POPLmark_challenge.