Closed nominal rewriting and efficiently computable nominal algebra equality

Details Closed nominal rewriting and efficiently computable nominal algebra equality Closed nominal rewriting and efficiently computable nominal algebra equality

2010-09-14

arxiv.org/abs/1009.2791v1

EPTCS 34, 2010, pp. 37-51

Computer Science

Logic in Computer Science

In Proceedings LFMTP 2010, arXiv:1009.2189

Scientific paper

10.4204/EPTCS.34.5

We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of the lambda-calculus and first-order logic.

Affiliated with

Also associated with

No associations

Rating

Closed nominal rewriting and efficiently computable nominal algebra equality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Closed nominal rewriting and efficiently computable nominal algebra equality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Closed nominal rewriting and efficiently computable nominal algebra equality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76507