Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/POPLmark_challenge> ?p ?o }
Showing triples 1 to 75 of
75
with 100 triples 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 wikiPageLength "3583".
- POPLmark_challenge wikiPageOutDegree "34".
- POPLmark_challenge wikiPageRevisionID "641427736".
- POPLmark_challenge wikiPageWikiLink ATS_(programming_language).
- POPLmark_challenge wikiPageWikiLink Automated_reasoning.
- POPLmark_challenge wikiPageWikiLink Benchmarking.
- POPLmark_challenge wikiPageWikiLink Benjamin_C._Pierce.
- POPLmark_challenge wikiPageWikiLink Category:Formal_methods.
- POPLmark_challenge wikiPageWikiLink Category:Programming_language_theory.
- POPLmark_challenge wikiPageWikiLink Category:Unsolved_problems_in_computer_science.
- POPLmark_challenge wikiPageWikiLink Coq.
- POPLmark_challenge wikiPageWikiLink Formal_methods.
- POPLmark_challenge wikiPageWikiLink Isabelle_(proof_assistant).
- POPLmark_challenge wikiPageWikiLink Isabelle_theorem_prover.
- POPLmark_challenge wikiPageWikiLink LNCS.
- POPLmark_challenge wikiPageWikiLink Lecture_Notes_in_Computer_Science.
- POPLmark_challenge wikiPageWikiLink Mathematical_induction.
- POPLmark_challenge wikiPageWikiLink Matita.
- POPLmark_challenge wikiPageWikiLink Matita_proof_assistant.
- POPLmark_challenge wikiPageWikiLink Metatheory.
- POPLmark_challenge wikiPageWikiLink Name_binding.
- POPLmark_challenge wikiPageWikiLink Normalization_property_(abstract_rewriting).
- POPLmark_challenge wikiPageWikiLink Operational_semantics.
- POPLmark_challenge wikiPageWikiLink POPL.
- POPLmark_challenge wikiPageWikiLink Pattern_matching.
- POPLmark_challenge wikiPageWikiLink Peter_Sewell.
- POPLmark_challenge wikiPageWikiLink Programming_language_theory.
- POPLmark_challenge wikiPageWikiLink QED_manifesto.
- POPLmark_challenge wikiPageWikiLink Record_(computer_science).
- POPLmark_challenge wikiPageWikiLink Simply_typed_lambda_calculus.
- POPLmark_challenge wikiPageWikiLink Strong_normalisation.
- POPLmark_challenge wikiPageWikiLink Subject_reduction.
- POPLmark_challenge wikiPageWikiLink Subtyping.
- POPLmark_challenge wikiPageWikiLink Symposium_on_Principles_of_Programming_Languages.
- POPLmark_challenge wikiPageWikiLink System_F.
- POPLmark_challenge wikiPageWikiLink System_F-sub.
- POPLmark_challenge wikiPageWikiLink Transitive_relation.
- POPLmark_challenge wikiPageWikiLink Twelf.
- POPLmark_challenge wikiPageWikiLink Type_safety.
- POPLmark_challenge wikiPageWikiLink University_of_Pennsylvania.
- POPLmark_challenge wikiPageWikiLinkText "POPLmark challenge".
- POPLmark_challenge hasPhotoCollection POPLmark_challenge.
- POPLmark_challenge wikiPageUsesTemplate Template:As_of.
- POPLmark_challenge wikiPageUsesTemplate Template:Comp-sci-stub.
- POPLmark_challenge wikiPageUsesTemplate Template:Multiple_issues.
- POPLmark_challenge wikiPageUsesTemplate Template:Prog-lang-stub.
- POPLmark_challenge subject Category:Formal_methods.
- POPLmark_challenge subject Category:Programming_language_theory.
- POPLmark_challenge subject Category:Unsolved_problems_in_computer_science.
- POPLmark_challenge hypernym Set.
- POPLmark_challenge type Area.
- POPLmark_challenge type Article.
- POPLmark_challenge type ProgrammingLanguage.
- POPLmark_challenge type Software.
- POPLmark_challenge type Work.
- POPLmark_challenge type Area.
- POPLmark_challenge type Article.
- POPLmark_challenge type Method.
- POPLmark_challenge type CreativeWork.
- POPLmark_challenge type Thing.
- POPLmark_challenge type Q386724.
- POPLmark_challenge type Q7397.
- POPLmark_challenge type Q9143.
- 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 wasDerivedFrom POPLmark_challenge?oldid=641427736.
- POPLmark_challenge isPrimaryTopicOf POPLmark_challenge.