Hi everybody, Maybe some of you, if not all, have heard of things like Church Numerals that use lambda calculus to model numbers and operators, or Peano Numbers that use axioms. This is more or less related to computational models. I'm concerned about finding a way to do the same with PEG / Backtracking. I, however, don't have any clue for where to start. I guess the grammar should play the role of the axioms and therefore the input should be the calculus to be computed / verified, but I can't figure out how it should actually work or even look. Anyway, I would be glad to have any piece of data on the matter. Feel free to send me anything you think may help. Thanks ! Kad
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
