THE 72OZ STEAK RULESMeal consists of: Shrimp Cocktail, Baked Potato, Salad, with Roll, Butter, and of course the 72 oz. SteakEntire meal must be completed in one hour. If any of the meal is not consumed (swallowed)…YOU LOSE!Before the time starts, you will be allowed to cut into the steak, and take one bite. If the steak tastes good and is cooked to your satisfaction, we will start the time upon your acceptable approval. The time will not stop, and the contest is on, so make SURE before you say “yes.”Once you have started you are not allowed to stand up, leave your table, or have anyone else TOUCH the meal.You will be disqualified if anyone assists you in cutting, preparing or eating of your meal. This is YOUR contest.You don’t have to eat the fat, but we will judge this.Should you become ill, the contest is over… YOU LOSE! (Please use the container provided as necessary.)You are required to pay the full amount up front; if you win we will refund 100%.You must sit at a table that we assign.If you do not win the steak challenge, you are welcome to take the leftovers with you.No consumption or sharing of the leftovers is allowed in the restaurant once the contest is over.If you fail to complete the challenge, you must pay the full $72 dollars.
What's the simplest contract you can imagine?
What is her internal representation of the deal in L4?






Hi guys. Am a lawyer (not a computer scientist!). Have been lurking for a while – this is a fascinating project.
To put the contract back into terms a common law lawyer would be familiar with (as a simple example):
++
1. The House agrees to sell the Patron a burger for $7.20 (the “Consideration”).
2. The House agrees to refund the Patron the Consideration in full, subject to completion of all of the following conditions precedent:
(a) the Patron shall consume the burger in full leaving nothing on the plate (“Full Consumption”);
(b) Full Consumption must take place within 1 hour of receipt of the burger by the Patron; and
(b) the Patron shall announce his completion of Full Consumption to the House.
++
What would be the challenges in re-creating drafting styles and structures familiar to lawyers (as above?)
Kind regards,
Jiekai
--
You received this message because you are subscribed to the Google Groups "Users and General Discussion" group.
To unsubscribe from this group and stop receiving emails from it, send an email to talk+uns...@lists.legalese.com.
To post to this group, send email to ta...@lists.legalese.com.
extern printf ();
enum S { x1, x2};
main () {
struct S { int abdd; } j;
int i = x1; switch(i) {
case 1:
case 2: printf ("%d\n",45);
default: printf ("%d\n",45);
;
;
}
if(i) {
printf ("%d\n",i);
} while(i--) {
2;
}
for(i; i; i++);
do {3;}
while (i);
}
(with apologies for the mangled spacing)
becomes...
Let printf be an external function with no arguments returning an integer. Let S be an enumeration with values x1 equal to 0 and x2 equal to 1. Let main be a function returning an integer. It is called with no arguments. To perform the function, let S be a structure with member abdd, where abdd is an integer. Let j be a S structure. Let i be an integer, whose initial value is enumeration x1. Perform block 1, starting at case i, or the default case if no such case exists. To perform block 1, first let this be the start of case 1. Let this be the start of case 2. Pass the string "%d\n" and 45 to printf. Then let this be the start of the default case. Pass the string "%d\n" and 45 to printf. Next, compute nothing. After that, compute nothing. This ends block 1. Continuing on, we next perform block 2 provided zero does not equal i. To perform block 2, pass the string "%d\n" and i to printf. Continuing on, we next continue to perform block 3 as long as zero does not equal i before decrementing i by one at the beginning of the iteration. To perform block 3, evaluate 2. Continuing on, we next continue to compute nothing as long as zero does not equal i prior to the iteration; before starting this loop, evaluate i; upon completion of each iteration of the loop, increment i by one. Then continue to perform block 4 as long as zero does not equal i at the end of the iteration. To perform block 4, evaluate 3.