<http://webisa.webdatacommons.org/49079237>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://www.w3.org/ns/prov#Entity> .
<http://webisa.webdatacommons.org/prov/141525349>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://webisa.webdatacommons.org/49079237> .
<http://webisa.webdatacommons.org/prov/49542737>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://webisa.webdatacommons.org/49079237> .
<http://webisa.webdatacommons.org/49079237>	<http://www.w3.org/ns/prov#value>	"Ideally we would obtain a way to formally prove that Kiama-based components were doing the correct things.Evaluating Dependently Typed Programming in AGDA (Verity)On the one hand, AGDA is a dependently typed functional programming language, which owes much of its design to popular mainstream strongly typed languages such as ML and Haskell." .
<http://webisa.webdatacommons.org/49079237>	<http://www.w3.org/ns/prov#wasQuotedFrom>	<mq.edu.au> .