Poly/ML February 2014

polyml@lists.polyml.org

7 participants
12 discussions

Pretty-printing infix constructors
by Rda＠lemma-one.com 06 Feb '14

06 Feb '14

When I executed the following infix xxx; datatype XXX = op xxx of int * string; 1 xxx "banana"; I was rather hopping the expression at the end would print out with infix notation but it doesn't: val it = xxx (1, "banana"): XXX Is there an option in Poly/ML to have infix constructors print as infixes, or do I need to write my own pretty-printer to get that. Regards, Rob.

2 1

PolyML.pointerEq
by Brian.Campbell＠ed.ac.uk 05 Feb '14

05 Feb '14

What semantics, if any, does PolyML.pointerEq have? In particular, is it supposed to be guaranteed that if pointerEq (x,y) is true, then it will remain true after GC? My reason for asking is that I've been having trouble with assertion failures in HOL when reducing large terms. The assertions check that the left hand side of the conclusions of two theorem objects are equal according to pointerEq, because this allows a fast comparison that "should" always be true if the theorem is manipulated carefully. I'm fairly certain the assertion failures are related to GC: they are non-deterministic on code that ought to be deterministic, and vary in frequency across different machines. (I haven't seen it at all on a 4GB 32-bit machine, rarely on 4GB 64-bit, often on the 8GB I normally use and infrequently on a compute server with much more.) There's no sign of any data corruption, however. Brian

3 4

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

Poly/ML February 2014