A Language for Verification and Manipulation of Web Documents: (Extended Abstract) |
| |
Authors: | Luigi Liquori Furio Honsell Rekha Redamalla |
| |
Affiliation: | INRIA, France;DIMI, University of Udine, Italy;Birla Science Center, Adarsh Nagar, Hyderabad, India |
| |
Abstract: | In this paper we develop the language theory underpinning the logical framework PLF. This language features lambda abstraction with patterns and application via pattern-matching. Reductions are allowed in patterns. The framework is particularly suited as a metalanguage for encoding rewriting logics and logical systems where proof terms have a special syntactic constraints, as in term rewriting systems, and rule-based languages. PLF is a conservative extension of the well-known Edinburgh Logical Framework LF. Because of sophisticated pattern matching facilities PLF is suitable for verification and manipulation of HXML documents. |
| |
Keywords: | Rewriting Logics lambda abstraction pattern matching Edinburgh Logical Framework LF |
本文献已被 ScienceDirect 等数据库收录! |